./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-dietlibc/strtol.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 3061b6dc 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/termination-dietlibc/strtol.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash bcbc91130461471a924c9b7d42b69988876440be9da9cf52278e4a7d2ea580f0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 10:18:55,571 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 10:18:55,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-11-19 10:18:55,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 10:18:55,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 10:18:55,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 10:18:55,670 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 10:18:55,670 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 10:18:55,671 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 10:18:55,672 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 10:18:55,672 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 10:18:55,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 10:18:55,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 10:18:55,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 10:18:55,674 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 10:18:55,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 10:18:55,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 10:18:55,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 10:18:55,677 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 10:18:55,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 10:18:55,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 10:18:55,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 10:18:55,680 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 10:18:55,680 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-19 10:18:55,680 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 10:18:55,681 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 10:18:55,681 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 10:18:55,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 10:18:55,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 10:18:55,682 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 10:18:55,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 10:18:55,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:18:55,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 10:18:55,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 10:18:55,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 10:18:55,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 10:18:55,684 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 10:18:55,684 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 10:18:55,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 10:18:55,684 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 10:18:55,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 10:18:55,685 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bcbc91130461471a924c9b7d42b69988876440be9da9cf52278e4a7d2ea580f0 [2024-11-19 10:18:55,915 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 10:18:55,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 10:18:55,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 10:18:55,950 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 10:18:55,951 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 10:18:55,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-dietlibc/strtol.i [2024-11-19 10:18:57,397 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 10:18:57,628 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 10:18:57,629 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/strtol.i [2024-11-19 10:18:57,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f3c41e6/c6a510a0aeb34e6eb6520c54305d4b75/FLAG82c528429 [2024-11-19 10:18:57,662 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f3c41e6/c6a510a0aeb34e6eb6520c54305d4b75 [2024-11-19 10:18:57,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 10:18:57,667 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 10:18:57,668 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 10:18:57,669 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 10:18:57,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 10:18:57,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:57" (1/1) ... [2024-11-19 10:18:57,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ba3e9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:57, skipping insertion in model container [2024-11-19 10:18:57,677 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:18:57" (1/1) ... [2024-11-19 10:18:57,724 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 10:18:58,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:18:58,055 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 10:18:58,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 10:18:58,154 INFO L204 MainTranslator]: Completed translation [2024-11-19 10:18:58,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58 WrapperNode [2024-11-19 10:18:58,155 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 10:18:58,156 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 10:18:58,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 10:18:58,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 10:18:58,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,182 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,220 INFO L138 Inliner]: procedures = 116, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 211 [2024-11-19 10:18:58,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 10:18:58,221 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 10:18:58,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 10:18:58,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 10:18:58,232 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,236 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,255 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [4, 13]. 76 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 4 writes are split as follows [2, 2]. [2024-11-19 10:18:58,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,272 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,280 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 10:18:58,281 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 10:18:58,282 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 10:18:58,282 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 10:18:58,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (1/1) ... [2024-11-19 10:18:58,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 10:18:58,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:58,318 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-19 10:18:58,322 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-19 10:18:58,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 10:18:58,372 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 10:18:58,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 10:18:58,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 10:18:58,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 10:18:58,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 10:18:58,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 10:18:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 10:18:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 10:18:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 10:18:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 10:18:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 10:18:58,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 10:18:58,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 10:18:58,492 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 10:18:58,494 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 10:18:58,824 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-19 10:18:58,824 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 10:18:58,841 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 10:18:58,842 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 10:18:58,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:58 BoogieIcfgContainer [2024-11-19 10:18:58,843 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 10:18:58,845 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 10:18:58,845 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 10:18:58,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 10:18:58,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:18:57" (1/3) ... [2024-11-19 10:18:58,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f804d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:58, skipping insertion in model container [2024-11-19 10:18:58,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:18:58" (2/3) ... [2024-11-19 10:18:58,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f804d8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:18:58, skipping insertion in model container [2024-11-19 10:18:58,851 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:58" (3/3) ... [2024-11-19 10:18:58,852 INFO L112 eAbstractionObserver]: Analyzing ICFG strtol.i [2024-11-19 10:18:58,869 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 10:18:58,869 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2024-11-19 10:18:58,919 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 10:18:58,925 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;@26055fe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 10:18:58,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2024-11-19 10:18:58,929 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 80 states have internal predecessors, (107), 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-19 10:18:58,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 10:18:58,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:58,933 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 10:18:58,933 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:18:58,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:58,937 INFO L85 PathProgramCache]: Analyzing trace with hash 925671, now seen corresponding path program 1 times [2024-11-19 10:18:58,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:58,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197283238] [2024-11-19 10:18:58,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:58,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:59,108 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-19 10:18:59,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:59,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197283238] [2024-11-19 10:18:59,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197283238] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:59,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:59,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:18:59,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943404938] [2024-11-19 10:18:59,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:59,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:18:59,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:59,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:18:59,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:18:59,133 INFO L87 Difference]: Start difference. First operand has 81 states, 62 states have (on average 1.7258064516129032) internal successors, (107), 80 states have internal predecessors, (107), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-19 10:18:59,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:59,180 INFO L93 Difference]: Finished difference Result 138 states and 198 transitions. [2024-11-19 10:18:59,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:18:59,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-19 10:18:59,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:59,189 INFO L225 Difference]: With dead ends: 138 [2024-11-19 10:18:59,189 INFO L226 Difference]: Without dead ends: 34 [2024-11-19 10:18:59,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:18:59,195 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 11 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:59,196 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 156 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:59,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-19 10:18:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-19 10:18:59,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 33 states have internal predecessors, (40), 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-19 10:18:59,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2024-11-19 10:18:59,239 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 4 [2024-11-19 10:18:59,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:59,239 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2024-11-19 10:18:59,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-19 10:18:59,240 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2024-11-19 10:18:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-19 10:18:59,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:59,241 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 10:18:59,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 10:18:59,241 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:18:59,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:59,242 INFO L85 PathProgramCache]: Analyzing trace with hash 28695845, now seen corresponding path program 1 times [2024-11-19 10:18:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:59,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697736454] [2024-11-19 10:18:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:59,333 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-19 10:18:59,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:59,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697736454] [2024-11-19 10:18:59,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697736454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:59,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:59,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 10:18:59,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946150043] [2024-11-19 10:18:59,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:59,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 10:18:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 10:18:59,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:18:59,338 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-19 10:18:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:59,361 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-11-19 10:18:59,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 10:18:59,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2024-11-19 10:18:59,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:59,364 INFO L225 Difference]: With dead ends: 34 [2024-11-19 10:18:59,365 INFO L226 Difference]: Without dead ends: 32 [2024-11-19 10:18:59,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 10:18:59,366 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:59,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 55 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-19 10:18:59,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-11-19 10:18:59,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 31 states have internal predecessors, (38), 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-19 10:18:59,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2024-11-19 10:18:59,374 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 5 [2024-11-19 10:18:59,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:59,374 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2024-11-19 10:18:59,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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-19 10:18:59,375 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2024-11-19 10:18:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-19 10:18:59,375 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:59,375 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:59,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 10:18:59,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:18:59,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash 179475214, now seen corresponding path program 1 times [2024-11-19 10:18:59,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:59,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996385425] [2024-11-19 10:18:59,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:59,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:59,492 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-19 10:18:59,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:59,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996385425] [2024-11-19 10:18:59,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996385425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:59,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:18:59,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:18:59,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371795111] [2024-11-19 10:18:59,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:59,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:18:59,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:59,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:18:59,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:18:59,495 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-19 10:18:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:59,524 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2024-11-19 10:18:59,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:18:59,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-11-19 10:18:59,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:59,529 INFO L225 Difference]: With dead ends: 40 [2024-11-19 10:18:59,529 INFO L226 Difference]: Without dead ends: 38 [2024-11-19 10:18:59,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-19 10:18:59,531 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:59,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:59,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-19 10:18:59,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-19 10:18:59,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 37 states have internal predecessors, (45), 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-19 10:18:59,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-11-19 10:18:59,537 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 8 [2024-11-19 10:18:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:59,537 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-11-19 10:18:59,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-19 10:18:59,537 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-11-19 10:18:59,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-19 10:18:59,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:59,538 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-19 10:18:59,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 10:18:59,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:18:59,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:18:59,539 INFO L85 PathProgramCache]: Analyzing trace with hash 906933384, now seen corresponding path program 1 times [2024-11-19 10:18:59,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:18:59,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220352214] [2024-11-19 10:18:59,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:59,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:18:59,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:59,683 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:59,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:18:59,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220352214] [2024-11-19 10:18:59,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220352214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:18:59,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854863926] [2024-11-19 10:18:59,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:18:59,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:18:59,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:18:59,688 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-19 10:18:59,689 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-19 10:18:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:18:59,774 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:18:59,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:18:59,847 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:18:59,847 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 10:18:59,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854863926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:18:59,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 10:18:59,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2024-11-19 10:18:59,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653121018] [2024-11-19 10:18:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:18:59,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:18:59,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:18:59,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:18:59,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:18:59,853 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-19 10:18:59,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:18:59,906 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2024-11-19 10:18:59,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:18:59,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2024-11-19 10:18:59,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:18:59,908 INFO L225 Difference]: With dead ends: 38 [2024-11-19 10:18:59,909 INFO L226 Difference]: Without dead ends: 37 [2024-11-19 10:18:59,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:18:59,910 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:18:59,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 119 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:18:59,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-19 10:18:59,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-19 10:18:59,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 36 states have internal predecessors, (44), 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-19 10:18:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-19 10:18:59,917 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 14 [2024-11-19 10:18:59,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:18:59,918 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-19 10:18:59,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 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-19 10:18:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-19 10:18:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 10:18:59,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:18:59,919 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-19 10:18:59,936 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-19 10:19:00,119 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-19 10:19:00,120 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:19:00,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:00,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1949836113, now seen corresponding path program 1 times [2024-11-19 10:19:00,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805339605] [2024-11-19 10:19:00,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:00,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:00,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:00,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:19:00,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805339605] [2024-11-19 10:19:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805339605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 10:19:00,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1687522659] [2024-11-19 10:19:00,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:00,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 10:19:00,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 10:19:00,257 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-19 10:19:00,259 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-19 10:19:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:00,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 10:19:00,340 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 10:19:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:19:00,381 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 10:19:00,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 10:19:00,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1687522659] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 10:19:00,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 10:19:00,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2024-11-19 10:19:00,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381289953] [2024-11-19 10:19:00,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 10:19:00,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 10:19:00,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 10:19:00,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:19:00,444 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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-19 10:19:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:00,510 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2024-11-19 10:19:00,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 10:19:00,510 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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 15 [2024-11-19 10:19:00,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:00,512 INFO L225 Difference]: With dead ends: 56 [2024-11-19 10:19:00,512 INFO L226 Difference]: Without dead ends: 55 [2024-11-19 10:19:00,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-19 10:19:00,513 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:00,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 216 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:19:00,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-19 10:19:00,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-19 10:19:00,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.25) internal successors, (65), 54 states have internal predecessors, (65), 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-19 10:19:00,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2024-11-19 10:19:00,522 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 15 [2024-11-19 10:19:00,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:00,522 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2024-11-19 10:19:00,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 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-19 10:19:00,522 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2024-11-19 10:19:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:19:00,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:00,523 INFO L215 NwaCegarLoop]: trace histogram [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-19 10:19:00,538 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-19 10:19:00,727 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-19 10:19:00,728 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:19:00,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:00,729 INFO L85 PathProgramCache]: Analyzing trace with hash 836677175, now seen corresponding path program 1 times [2024-11-19 10:19:00,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:00,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305275013] [2024-11-19 10:19:00,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:00,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:01,007 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-19 10:19:01,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:01,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305275013] [2024-11-19 10:19:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305275013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:01,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:01,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 10:19:01,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728978815] [2024-11-19 10:19:01,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:01,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 10:19:01,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:01,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 10:19:01,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:19:01,011 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-19 10:19:01,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:01,032 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2024-11-19 10:19:01,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 10:19:01,033 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-11-19 10:19:01,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:01,034 INFO L225 Difference]: With dead ends: 60 [2024-11-19 10:19:01,035 INFO L226 Difference]: Without dead ends: 59 [2024-11-19 10:19:01,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 10:19:01,036 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 2 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:01,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 88 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 10:19:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-19 10:19:01,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2024-11-19 10:19:01,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 57 states have internal predecessors, (68), 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-19 10:19:01,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2024-11-19 10:19:01,043 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 23 [2024-11-19 10:19:01,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:01,044 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2024-11-19 10:19:01,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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-19 10:19:01,044 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2024-11-19 10:19:01,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:19:01,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:01,047 INFO L215 NwaCegarLoop]: trace histogram [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-19 10:19:01,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 10:19:01,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:19:01,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:01,048 INFO L85 PathProgramCache]: Analyzing trace with hash 836736757, now seen corresponding path program 1 times [2024-11-19 10:19:01,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:01,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231595110] [2024-11-19 10:19:01,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:01,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:01,300 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-19 10:19:01,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:01,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231595110] [2024-11-19 10:19:01,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231595110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:01,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:01,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:19:01,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781145800] [2024-11-19 10:19:01,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:01,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:19:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:01,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:19:01,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:19:01,303 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-19 10:19:01,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:01,384 INFO L93 Difference]: Finished difference Result 99 states and 117 transitions. [2024-11-19 10:19:01,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:19:01,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2024-11-19 10:19:01,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:01,385 INFO L225 Difference]: With dead ends: 99 [2024-11-19 10:19:01,385 INFO L226 Difference]: Without dead ends: 82 [2024-11-19 10:19:01,386 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:19:01,386 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:01,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:19:01,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-19 10:19:01,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 65. [2024-11-19 10:19:01,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 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-19 10:19:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2024-11-19 10:19:01,409 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 23 [2024-11-19 10:19:01,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:01,409 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2024-11-19 10:19:01,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-19 10:19:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2024-11-19 10:19:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-19 10:19:01,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:01,411 INFO L215 NwaCegarLoop]: trace histogram [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-19 10:19:01,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 10:19:01,411 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:19:01,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:01,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1537801335, now seen corresponding path program 1 times [2024-11-19 10:19:01,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:01,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769856946] [2024-11-19 10:19:01,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:01,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:01,532 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-19 10:19:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:01,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769856946] [2024-11-19 10:19:01,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769856946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:01,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:01,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 10:19:01,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018184760] [2024-11-19 10:19:01,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:01,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 10:19:01,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:01,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 10:19:01,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 10:19:01,536 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-19 10:19:01,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:01,614 INFO L93 Difference]: Finished difference Result 109 states and 126 transitions. [2024-11-19 10:19:01,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 10:19:01,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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 23 [2024-11-19 10:19:01,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:01,615 INFO L225 Difference]: With dead ends: 109 [2024-11-19 10:19:01,615 INFO L226 Difference]: Without dead ends: 98 [2024-11-19 10:19:01,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-19 10:19:01,616 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 35 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:01,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 143 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:19:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-19 10:19:01,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 70. [2024-11-19 10:19:01,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 67 states have (on average 1.2238805970149254) internal successors, (82), 69 states have internal predecessors, (82), 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-19 10:19:01,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 82 transitions. [2024-11-19 10:19:01,631 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 82 transitions. Word has length 23 [2024-11-19 10:19:01,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:01,634 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 82 transitions. [2024-11-19 10:19:01,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 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-19 10:19:01,635 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 82 transitions. [2024-11-19 10:19:01,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:19:01,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:01,636 INFO L215 NwaCegarLoop]: trace histogram [1, 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-19 10:19:01,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 10:19:01,636 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:19:01,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash 2082892717, now seen corresponding path program 1 times [2024-11-19 10:19:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:01,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560256060] [2024-11-19 10:19:01,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:01,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 10:19:01,941 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-19 10:19:01,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 10:19:01,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560256060] [2024-11-19 10:19:01,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560256060] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 10:19:01,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 10:19:01,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 10:19:01,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662809763] [2024-11-19 10:19:01,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 10:19:01,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 10:19:01,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 10:19:01,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 10:19:01,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 10:19:01,943 INFO L87 Difference]: Start difference. First operand 70 states and 82 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-19 10:19:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 10:19:02,038 INFO L93 Difference]: Finished difference Result 114 states and 131 transitions. [2024-11-19 10:19:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 10:19:02,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2024-11-19 10:19:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 10:19:02,040 INFO L225 Difference]: With dead ends: 114 [2024-11-19 10:19:02,040 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 10:19:02,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-19 10:19:02,041 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 10:19:02,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 91 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 10:19:02,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 10:19:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2024-11-19 10:19:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 73 states have (on average 1.2191780821917808) internal successors, (89), 75 states have internal predecessors, (89), 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-19 10:19:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2024-11-19 10:19:02,047 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 89 transitions. Word has length 24 [2024-11-19 10:19:02,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 10:19:02,047 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 89 transitions. [2024-11-19 10:19:02,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 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-19 10:19:02,047 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 89 transitions. [2024-11-19 10:19:02,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-19 10:19:02,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 10:19:02,048 INFO L215 NwaCegarLoop]: trace histogram [1, 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-19 10:19:02,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 10:19:02,049 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2024-11-19 10:19:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 10:19:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2140151019, now seen corresponding path program 1 times [2024-11-19 10:19:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 10:19:02,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444188666] [2024-11-19 10:19:02,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 10:19:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 10:19:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:19:02,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 10:19:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 10:19:02,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 10:19:02,099 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 10:19:02,100 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 18 remaining) [2024-11-19 10:19:02,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 18 remaining) [2024-11-19 10:19:02,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2024-11-19 10:19:02,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2024-11-19 10:19:02,102 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2024-11-19 10:19:02,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2024-11-19 10:19:02,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2024-11-19 10:19:02,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2024-11-19 10:19:02,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 18 remaining) [2024-11-19 10:19:02,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 18 remaining) [2024-11-19 10:19:02,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 18 remaining) [2024-11-19 10:19:02,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 18 remaining) [2024-11-19 10:19:02,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2024-11-19 10:19:02,103 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2024-11-19 10:19:02,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2024-11-19 10:19:02,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2024-11-19 10:19:02,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2024-11-19 10:19:02,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2024-11-19 10:19:02,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 10:19:02,107 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 10:19:02,142 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 10:19:02,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:19:02 BoogieIcfgContainer [2024-11-19 10:19:02,145 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 10:19:02,146 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 10:19:02,146 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 10:19:02,146 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 10:19:02,147 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:18:58" (3/4) ... [2024-11-19 10:19:02,147 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-19 10:19:02,184 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 10:19:02,184 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 10:19:02,185 INFO L158 Benchmark]: Toolchain (without parser) took 4519.20ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 134.4MB in the beginning and 139.4MB in the end (delta: -5.0MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-11-19 10:19:02,186 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 113.2MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:19:02,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 486.70ms. Allocated memory is still 161.5MB. Free memory was 133.5MB in the beginning and 113.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 10:19:02,186 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.79ms. Allocated memory is still 161.5MB. Free memory was 113.6MB in the beginning and 110.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 10:19:02,187 INFO L158 Benchmark]: Boogie Preprocessor took 59.26ms. Allocated memory is still 161.5MB. Free memory was 110.5MB in the beginning and 107.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:19:02,187 INFO L158 Benchmark]: RCFGBuilder took 561.52ms. Allocated memory is still 161.5MB. Free memory was 107.3MB in the beginning and 83.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-19 10:19:02,187 INFO L158 Benchmark]: TraceAbstraction took 3300.64ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 82.2MB in the beginning and 142.5MB in the end (delta: -60.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 10:19:02,187 INFO L158 Benchmark]: Witness Printer took 38.84ms. Allocated memory is still 195.0MB. Free memory was 142.5MB in the beginning and 139.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 10:19:02,189 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.19ms. Allocated memory is still 113.2MB. Free memory is still 72.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 486.70ms. Allocated memory is still 161.5MB. Free memory was 133.5MB in the beginning and 113.6MB in the end (delta: 19.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.79ms. Allocated memory is still 161.5MB. Free memory was 113.6MB in the beginning and 110.5MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.26ms. Allocated memory is still 161.5MB. Free memory was 110.5MB in the beginning and 107.3MB in the end (delta: 3.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 561.52ms. Allocated memory is still 161.5MB. Free memory was 107.3MB in the beginning and 83.3MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3300.64ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 82.2MB in the beginning and 142.5MB in the end (delta: -60.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 38.84ms. Allocated memory is still 195.0MB. Free memory was 142.5MB in the beginning and 139.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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 - CounterExampleResult [Line: 519]: integer overflow possible integer overflow possible We found a FailurePath: [L562] int in_len = __VERIFIER_nondet_int(); [L563] COND FALSE !(in_len < 1) [L564] char* in = __builtin_alloca (in_len); [L565] int i=0; VAL [i=0, in={3:0}, in_len=1] [L565] EXPR in_len-1 VAL [i=0, in={3:0}, in_len=1] [L565] COND FALSE !(i