./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/memsafety-ext2/length_test03-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 16:56:29,199 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 16:56:29,274 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 16:56:29,277 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 16:56:29,278 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 16:56:29,311 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 16:56:29,312 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 16:56:29,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 16:56:29,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 16:56:29,313 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 16:56:29,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 16:56:29,315 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 16:56:29,316 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 16:56:29,317 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 16:56:29,318 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 16:56:29,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 16:56:29,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 16:56:29,319 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 16:56:29,319 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 16:56:29,319 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 16:56:29,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 16:56:29,323 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 16:56:29,323 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 16:56:29,324 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 16:56:29,324 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 16:56:29,324 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 16:56:29,324 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 16:56:29,324 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 16:56:29,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 16:56:29,325 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 16:56:29,325 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 16:56:29,325 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 16:56:29,325 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 16:56:29,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 16:56:29,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:56:29,326 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 16:56:29,326 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 16:56:29,326 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 16:56:29,326 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 16:56:29,326 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 16:56:29,327 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 16:56:29,327 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 16:56:29,327 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 16:56:29,327 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 16:56:29,328 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2024-11-12 16:56:29,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 16:56:29,625 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 16:56:29,627 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 16:56:29,628 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 16:56:29,629 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 16:56:29,630 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-12 16:56:31,245 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 16:56:31,510 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 16:56:31,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2024-11-12 16:56:31,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fc2ddc1/8b78c74017b14a8e8ce94df3ad509e56/FLAG063295d5f [2024-11-12 16:56:31,543 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/27fc2ddc1/8b78c74017b14a8e8ce94df3ad509e56 [2024-11-12 16:56:31,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 16:56:31,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 16:56:31,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 16:56:31,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 16:56:31,558 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 16:56:31,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:31,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e45a90d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31, skipping insertion in model container [2024-11-12 16:56:31,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:31,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 16:56:31,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:56:31,923 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 16:56:31,973 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 16:56:31,998 INFO L204 MainTranslator]: Completed translation [2024-11-12 16:56:31,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31 WrapperNode [2024-11-12 16:56:31,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 16:56:32,000 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 16:56:32,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 16:56:32,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 16:56:32,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,023 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,042 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 93 [2024-11-12 16:56:32,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 16:56:32,043 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 16:56:32,043 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 16:56:32,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 16:56:32,052 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,052 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,055 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,070 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 10, 13]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 13 writes are split as follows [0, 6, 7]. [2024-11-12 16:56:32,071 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,071 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,076 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,079 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,081 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,081 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,084 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 16:56:32,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 16:56:32,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 16:56:32,085 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 16:56:32,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (1/1) ... [2024-11-12 16:56:32,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 16:56:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:32,121 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 16:56:32,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 16:56:32,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 16:56:32,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 16:56:32,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 16:56:32,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-12 16:56:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 16:56:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 16:56:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 16:56:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 16:56:32,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 16:56:32,164 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 16:56:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 16:56:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 16:56:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 16:56:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 16:56:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 16:56:32,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 16:56:32,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 16:56:32,166 INFO L130 BoogieDeclarations]: Found specification of procedure append [2024-11-12 16:56:32,166 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2024-11-12 16:56:32,266 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 16:56:32,270 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 16:56:32,490 INFO L? ?]: Removed 43 outVars from TransFormulas that were not future-live. [2024-11-12 16:56:32,490 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 16:56:32,500 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 16:56:32,501 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-12 16:56:32,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:32 BoogieIcfgContainer [2024-11-12 16:56:32,502 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 16:56:32,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 16:56:32,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 16:56:32,506 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 16:56:32,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 04:56:31" (1/3) ... [2024-11-12 16:56:32,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e944145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:32, skipping insertion in model container [2024-11-12 16:56:32,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 04:56:31" (2/3) ... [2024-11-12 16:56:32,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e944145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 04:56:32, skipping insertion in model container [2024-11-12 16:56:32,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:32" (3/3) ... [2024-11-12 16:56:32,508 INFO L112 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2024-11-12 16:56:32,521 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 16:56:32,521 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-11-12 16:56:32,573 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 16:56:32,579 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@11bbbe43, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 16:56:32,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-11-12 16:56:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:56:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-12 16:56:32,587 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:32,588 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:32,589 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:32,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:32,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1764945748, now seen corresponding path program 1 times [2024-11-12 16:56:32,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:32,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100530398] [2024-11-12 16:56:32,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:32,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:32,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:32,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100530398] [2024-11-12 16:56:32,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100530398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:32,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:32,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 16:56:32,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770025638] [2024-11-12 16:56:32,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:32,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 16:56:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:32,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 16:56:32,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 16:56:32,857 INFO L87 Difference]: Start difference. First operand has 34 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 30 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:32,916 INFO L93 Difference]: Finished difference Result 61 states and 78 transitions. [2024-11-12 16:56:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 16:56:32,919 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-12 16:56:32,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:32,931 INFO L225 Difference]: With dead ends: 61 [2024-11-12 16:56:32,932 INFO L226 Difference]: Without dead ends: 30 [2024-11-12 16:56:32,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 16:56:32,966 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:32,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:32,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-12 16:56:33,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-12 16:56:33,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.391304347826087) internal successors, (32), 26 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:56:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2024-11-12 16:56:33,007 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 11 [2024-11-12 16:56:33,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:33,007 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2024-11-12 16:56:33,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:33,008 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2024-11-12 16:56:33,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-12 16:56:33,009 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:33,009 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:33,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 16:56:33,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:33,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:33,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2143751006, now seen corresponding path program 1 times [2024-11-12 16:56:33,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:33,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692031221] [2024-11-12 16:56:33,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:33,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:33,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 16:56:33,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-12 16:56:33,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:33,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692031221] [2024-11-12 16:56:33,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692031221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:33,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:33,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:56:33,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768948253] [2024-11-12 16:56:33,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:33,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 16:56:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:33,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 16:56:33,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:56:33,272 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:56:33,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:33,339 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-11-12 16:56:33,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 16:56:33,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2024-11-12 16:56:33,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:33,341 INFO L225 Difference]: With dead ends: 45 [2024-11-12 16:56:33,341 INFO L226 Difference]: Without dead ends: 36 [2024-11-12 16:56:33,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-12 16:56:33,343 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:33,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:56:33,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-12 16:56:33,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2024-11-12 16:56:33,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.375) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:56:33,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2024-11-12 16:56:33,352 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 20 [2024-11-12 16:56:33,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:33,352 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2024-11-12 16:56:33,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-12 16:56:33,353 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2024-11-12 16:56:33,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-12 16:56:33,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:33,354 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:33,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-12 16:56:33,354 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:33,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:33,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1565841550, now seen corresponding path program 1 times [2024-11-12 16:56:33,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:33,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822992729] [2024-11-12 16:56:33,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:33,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:33,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 16:56:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:33,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 16:56:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:33,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:56:33,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:33,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822992729] [2024-11-12 16:56:33,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822992729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:33,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:33,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:56:33,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623270153] [2024-11-12 16:56:33,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:33,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:56:33,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:33,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:56:33,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:33,608 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:56:33,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:33,691 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-12 16:56:33,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:56:33,692 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2024-11-12 16:56:33,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:33,693 INFO L225 Difference]: With dead ends: 40 [2024-11-12 16:56:33,694 INFO L226 Difference]: Without dead ends: 38 [2024-11-12 16:56:33,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:33,695 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:33,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 98 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:56:33,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-12 16:56:33,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-11-12 16:56:33,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.3214285714285714) internal successors, (37), 31 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 16:56:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-11-12 16:56:33,704 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2024-11-12 16:56:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:33,705 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-11-12 16:56:33,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-12 16:56:33,705 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-11-12 16:56:33,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-12 16:56:33,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:33,706 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:33,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 16:56:33,707 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:33,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:33,707 INFO L85 PathProgramCache]: Analyzing trace with hash -55997675, now seen corresponding path program 1 times [2024-11-12 16:56:33,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:33,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179937674] [2024-11-12 16:56:33,708 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:33,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:33,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:33,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 16:56:33,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:33,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 16:56:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:33,928 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:56:33,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:33,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179937674] [2024-11-12 16:56:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179937674] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:33,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977714952] [2024-11-12 16:56:33,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:33,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:33,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:33,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:56:33,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 16:56:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:34,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-12 16:56:34,087 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:56:34,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:56:34,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-12 16:56:34,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1977714952] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:56:34,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:56:34,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-12 16:56:34,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569699075] [2024-11-12 16:56:34,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:56:34,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-12 16:56:34,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:34,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-12 16:56:34,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-12 16:56:34,189 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 16:56:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:34,290 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2024-11-12 16:56:34,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 16:56:34,291 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 31 [2024-11-12 16:56:34,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:34,292 INFO L225 Difference]: With dead ends: 55 [2024-11-12 16:56:34,293 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 16:56:34,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2024-11-12 16:56:34,294 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 7 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:34,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 142 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 16:56:34,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 16:56:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2024-11-12 16:56:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 37 states have internal predecessors, (44), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 16:56:34,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-11-12 16:56:34,304 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 31 [2024-11-12 16:56:34,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:34,306 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-11-12 16:56:34,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 4 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 16:56:34,307 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-11-12 16:56:34,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-12 16:56:34,307 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:34,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:34,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 16:56:34,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:34,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:34,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:34,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1891055301, now seen corresponding path program 1 times [2024-11-12 16:56:34,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:34,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096980896] [2024-11-12 16:56:34,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:34,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:34,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 16:56:34,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:34,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 16:56:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:34,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 16:56:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:34,767 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 16:56:34,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096980896] [2024-11-12 16:56:34,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096980896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:34,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12614059] [2024-11-12 16:56:34,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:34,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:34,771 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:56:34,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 16:56:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:34,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:56:34,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:35,002 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-12 16:56:35,002 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:56:35,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12614059] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:35,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:56:35,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-12 16:56:35,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12686543] [2024-11-12 16:56:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:35,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:56:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:35,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:56:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:56:35,005 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 16:56:35,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:35,045 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2024-11-12 16:56:35,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:56:35,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2024-11-12 16:56:35,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:35,047 INFO L225 Difference]: With dead ends: 45 [2024-11-12 16:56:35,047 INFO L226 Difference]: Without dead ends: 44 [2024-11-12 16:56:35,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:56:35,048 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:35,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 104 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-11-12 16:56:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2024-11-12 16:56:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 36 states have internal predecessors, (42), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 16:56:35,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-11-12 16:56:35,052 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 34 [2024-11-12 16:56:35,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:35,053 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-11-12 16:56:35,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-12 16:56:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-11-12 16:56:35,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-12 16:56:35,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:35,054 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:35,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 16:56:35,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:35,259 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:35,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:35,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1005040531, now seen corresponding path program 1 times [2024-11-12 16:56:35,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:35,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791351213] [2024-11-12 16:56:35,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:35,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 16:56:35,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 16:56:35,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 16:56:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 16:56:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-12 16:56:35,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:35,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791351213] [2024-11-12 16:56:35,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791351213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:35,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:35,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:56:35,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7524848] [2024-11-12 16:56:35,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:35,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:56:35,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:35,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:56:35,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:35,404 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 16:56:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:35,449 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2024-11-12 16:56:35,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:56:35,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 46 [2024-11-12 16:56:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:35,450 INFO L225 Difference]: With dead ends: 43 [2024-11-12 16:56:35,450 INFO L226 Difference]: Without dead ends: 42 [2024-11-12 16:56:35,450 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:35,451 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:35,451 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 90 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-12 16:56:35,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-11-12 16:56:35,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 35 states have internal predecessors, (41), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 16:56:35,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-11-12 16:56:35,455 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 46 [2024-11-12 16:56:35,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:35,455 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-11-12 16:56:35,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-12 16:56:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-11-12 16:56:35,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-12 16:56:35,456 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:35,456 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:35,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-12 16:56:35,457 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:35,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:35,457 INFO L85 PathProgramCache]: Analyzing trace with hash -764384011, now seen corresponding path program 2 times [2024-11-12 16:56:35,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:35,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085384168] [2024-11-12 16:56:35,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:35,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 16:56:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 16:56:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 16:56:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 16:56:35,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:35,653 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2024-11-12 16:56:35,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:35,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085384168] [2024-11-12 16:56:35,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085384168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:35,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:35,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:56:35,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735379073] [2024-11-12 16:56:35,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:35,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:56:35,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:35,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:56:35,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:35,655 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:56:35,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:35,709 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2024-11-12 16:56:35,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:56:35,709 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 53 [2024-11-12 16:56:35,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:35,710 INFO L225 Difference]: With dead ends: 47 [2024-11-12 16:56:35,710 INFO L226 Difference]: Without dead ends: 45 [2024-11-12 16:56:35,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:35,710 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:35,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:35,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-12 16:56:35,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-12 16:56:35,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-12 16:56:35,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2024-11-12 16:56:35,715 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 53 [2024-11-12 16:56:35,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:35,715 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2024-11-12 16:56:35,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:56:35,716 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2024-11-12 16:56:35,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-12 16:56:35,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:35,717 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:35,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-12 16:56:35,717 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:35,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:35,717 INFO L85 PathProgramCache]: Analyzing trace with hash 436464497, now seen corresponding path program 1 times [2024-11-12 16:56:35,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:35,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722143557] [2024-11-12 16:56:35,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:35,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:36,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 16:56:36,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:36,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 16:56:36,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:36,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 16:56:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:36,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 16:56:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 24 proven. 12 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-12 16:56:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722143557] [2024-11-12 16:56:36,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722143557] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:36,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1226087028] [2024-11-12 16:56:36,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:36,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:36,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:36,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:56:36,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 16:56:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:36,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 16:56:36,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:36,556 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-12 16:56:36,557 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 16:56:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-12 16:56:36,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1226087028] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 16:56:36,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 16:56:36,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2024-11-12 16:56:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147327019] [2024-11-12 16:56:36,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 16:56:36,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-12 16:56:36,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:36,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-12 16:56:36,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2024-11-12 16:56:36,673 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 16:56:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:37,209 INFO L93 Difference]: Finished difference Result 140 states and 187 transitions. [2024-11-12 16:56:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-12 16:56:37,210 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) Word has length 57 [2024-11-12 16:56:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:37,212 INFO L225 Difference]: With dead ends: 140 [2024-11-12 16:56:37,212 INFO L226 Difference]: Without dead ends: 111 [2024-11-12 16:56:37,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 113 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2024-11-12 16:56:37,214 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:37,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 193 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 16:56:37,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-12 16:56:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2024-11-12 16:56:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 88 states have (on average 1.0909090909090908) internal successors, (96), 89 states have internal predecessors, (96), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-12 16:56:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2024-11-12 16:56:37,224 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 57 [2024-11-12 16:56:37,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:37,224 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2024-11-12 16:56:37,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.45) internal successors, (69), 19 states have internal predecessors, (69), 8 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 8 states have call predecessors, (9), 8 states have call successors, (9) [2024-11-12 16:56:37,225 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2024-11-12 16:56:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-12 16:56:37,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:37,226 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:37,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 16:56:37,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:37,431 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:37,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:37,431 INFO L85 PathProgramCache]: Analyzing trace with hash 182988255, now seen corresponding path program 1 times [2024-11-12 16:56:37,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:37,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261676911] [2024-11-12 16:56:37,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:37,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 16:56:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:37,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 16:56:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:37,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 16:56:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:37,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 16:56:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 16:56:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:37,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-12 16:56:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:37,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 16:56:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:37,753 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-12 16:56:37,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:37,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261676911] [2024-11-12 16:56:37,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261676911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 16:56:37,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138433346] [2024-11-12 16:56:37,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:37,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:37,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 16:56:37,759 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 16:56:37,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-12 16:56:38,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:38,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-12 16:56:38,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 16:56:38,120 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2024-11-12 16:56:38,120 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 16:56:38,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138433346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:38,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 16:56:38,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2024-11-12 16:56:38,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976517585] [2024-11-12 16:56:38,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:38,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 16:56:38,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:38,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 16:56:38,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:56:38,122 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:56:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:38,169 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2024-11-12 16:56:38,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 16:56:38,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 90 [2024-11-12 16:56:38,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:38,170 INFO L225 Difference]: With dead ends: 105 [2024-11-12 16:56:38,170 INFO L226 Difference]: Without dead ends: 104 [2024-11-12 16:56:38,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-12 16:56:38,171 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:38,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 117 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-12 16:56:38,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-11-12 16:56:38,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.0795454545454546) internal successors, (95), 88 states have internal predecessors, (95), 12 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (19), 13 states have call predecessors, (19), 12 states have call successors, (19) [2024-11-12 16:56:38,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-11-12 16:56:38,179 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 90 [2024-11-12 16:56:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:38,180 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-11-12 16:56:38,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:56:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2024-11-12 16:56:38,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-12 16:56:38,181 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 16:56:38,181 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:38,196 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-12 16:56:38,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 16:56:38,386 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2024-11-12 16:56:38,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 16:56:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1377668705, now seen corresponding path program 1 times [2024-11-12 16:56:38,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 16:56:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970074480] [2024-11-12 16:56:38,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 16:56:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 16:56:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:38,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-11-12 16:56:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:38,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-11-12 16:56:38,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:38,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-12 16:56:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:38,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-12 16:56:38,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:38,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 16:56:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:38,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-12 16:56:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:38,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 16:56:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 16:56:38,569 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-11-12 16:56:38,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 16:56:38,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970074480] [2024-11-12 16:56:38,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970074480] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 16:56:38,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 16:56:38,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-12 16:56:38,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365512602] [2024-11-12 16:56:38,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 16:56:38,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 16:56:38,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 16:56:38,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 16:56:38,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:38,571 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:56:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 16:56:38,620 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2024-11-12 16:56:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 16:56:38,620 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2024-11-12 16:56:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 16:56:38,621 INFO L225 Difference]: With dead ends: 104 [2024-11-12 16:56:38,621 INFO L226 Difference]: Without dead ends: 0 [2024-11-12 16:56:38,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-12 16:56:38,622 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 16:56:38,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 84 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 16:56:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-12 16:56:38,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-12 16:56:38,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-12 16:56:38,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-12 16:56:38,623 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2024-11-12 16:56:38,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 16:56:38,623 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-12 16:56:38,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-12 16:56:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-12 16:56:38,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-12 16:56:38,625 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2024-11-12 16:56:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2024-11-12 16:56:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2024-11-12 16:56:38,626 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2024-11-12 16:56:38,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 16:56:38,628 INFO L421 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 16:56:38,629 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-12 16:56:38,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 16:56:38,724 WARN L156 FloydHoareUtils]: Requires clause for append contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= |old(#memory_$Pointer$#2.base)| |#memory_$Pointer$#2.base|) (= |#memory_int#2| |old(#memory_int#2)|) (= |#memory_$Pointer$#2.offset| |old(#memory_$Pointer$#2.offset)|) (= |old(#memory_$Pointer$#1.base)| |#memory_$Pointer$#1.base|) (= |#memory_int#1| |old(#memory_int#1)|) (= |old(#memory_$Pointer$#1.offset)| |#memory_$Pointer$#1.offset|) (= |old(#valid)| |#valid|)) Eliminated clause: true [2024-11-12 16:56:38,735 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-12 16:56:38,765 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] [2024-11-12 16:56:38,765 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[#in~head!base,]]] [2024-11-12 16:56:38,765 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base [2024-11-12 16:56:38,765 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] [2024-11-12 16:56:38,765 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] [2024-11-12 16:56:38,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 04:56:38 BoogieIcfgContainer [2024-11-12 16:56:38,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 16:56:38,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 16:56:38,776 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 16:56:38,776 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 16:56:38,777 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 04:56:32" (3/4) ... [2024-11-12 16:56:38,779 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-12 16:56:38,781 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure append [2024-11-12 16:56:38,791 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-12 16:56:38,792 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-12 16:56:38,792 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-12 16:56:38,792 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-12 16:56:38,890 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-12 16:56:38,891 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-12 16:56:38,891 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 16:56:38,891 INFO L158 Benchmark]: Toolchain (without parser) took 7345.33ms. Allocated memory was 203.4MB in the beginning and 346.0MB in the end (delta: 142.6MB). Free memory was 171.7MB in the beginning and 303.7MB in the end (delta: -132.0MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2024-11-12 16:56:38,891 INFO L158 Benchmark]: CDTParser took 0.88ms. Allocated memory is still 130.0MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 16:56:38,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 451.88ms. Allocated memory is still 203.4MB. Free memory was 171.5MB in the beginning and 154.9MB in the end (delta: 16.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2024-11-12 16:56:38,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.86ms. Allocated memory is still 203.4MB. Free memory was 154.9MB in the beginning and 152.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:56:38,892 INFO L158 Benchmark]: Boogie Preprocessor took 40.49ms. Allocated memory is still 203.4MB. Free memory was 152.9MB in the beginning and 150.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 16:56:38,892 INFO L158 Benchmark]: RCFGBuilder took 417.38ms. Allocated memory is still 203.4MB. Free memory was 150.8MB in the beginning and 132.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 16:56:38,892 INFO L158 Benchmark]: TraceAbstraction took 6268.24ms. Allocated memory was 203.4MB in the beginning and 346.0MB in the end (delta: 142.6MB). Free memory was 131.9MB in the beginning and 308.9MB in the end (delta: -177.0MB). Peak memory consumption was 164.6MB. Max. memory is 16.1GB. [2024-11-12 16:56:38,892 INFO L158 Benchmark]: Witness Printer took 118.83ms. Allocated memory is still 346.0MB. Free memory was 308.9MB in the beginning and 303.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-12 16:56:38,893 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.88ms. Allocated memory is still 130.0MB. Free memory is still 93.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 451.88ms. Allocated memory is still 203.4MB. Free memory was 171.5MB in the beginning and 154.9MB in the end (delta: 16.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.86ms. Allocated memory is still 203.4MB. Free memory was 154.9MB in the beginning and 152.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.49ms. Allocated memory is still 203.4MB. Free memory was 152.9MB in the beginning and 150.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 417.38ms. Allocated memory is still 203.4MB. Free memory was 150.8MB in the beginning and 132.8MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6268.24ms. Allocated memory was 203.4MB in the beginning and 346.0MB in the end (delta: 142.6MB). Free memory was 131.9MB in the beginning and 308.9MB in the end (delta: -177.0MB). Peak memory consumption was 164.6MB. Max. memory is 16.1GB. * Witness Printer took 118.83ms. Allocated memory is still 346.0MB. Free memory was 308.9MB in the beginning and 303.7MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[UnaryExpression[OLD,IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL]],[IdentifierExpression[#in~head!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_$Pointer$#2.base - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_$Pointer$#2.base,GLOBAL],[IdentifierExpression[#in~head!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 591]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 34 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 10, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 47 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 1035 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 752 mSDsCounter, 41 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 597 IncrementalHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 41 mSolverCounterUnsat, 283 mSDtfsCounter, 597 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 350 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=8, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 18 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 668 NumberOfCodeBlocks, 668 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 740 ConstructedInterpolants, 0 QuantifiedInterpolants, 1903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2292 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 872/937 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 573]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 584]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 578]: Loop Invariant Derived loop invariant: ((c == 0) || (0 < c)) - InvariantResult [Line: 591]: Loop Invariant Derived loop invariant: ((c == 0) || (0 < c)) RESULT: Ultimate proved your program to be correct! [2024-11-12 16:56:38,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE