./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_17_good.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 18932daab2b6a9e703f41380254be4987ae24cad0ed52ef44ca676e3b35352e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 04:36:28,338 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 04:36:28,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 04:36:28,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 04:36:28,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 04:36:28,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 04:36:28,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 04:36:28,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 04:36:28,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 04:36:28,424 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 04:36:28,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 04:36:28,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 04:36:28,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 04:36:28,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 04:36:28,426 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 04:36:28,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 04:36:28,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 04:36:28,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 04:36:28,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 04:36:28,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 04:36:28,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 04:36:28,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 04:36:28,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 04:36:28,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 04:36:28,428 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 18932daab2b6a9e703f41380254be4987ae24cad0ed52ef44ca676e3b35352e8 [2025-03-09 04:36:28,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 04:36:28,666 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 04:36:28,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 04:36:28,669 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 04:36:28,669 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 04:36:28,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_17_good.i [2025-03-09 04:36:29,900 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d5a9306/db0385d705d84999a96ca423ff52003b/FLAG017c1ef59 [2025-03-09 04:36:30,287 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 04:36:30,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_17_good.i [2025-03-09 04:36:30,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d5a9306/db0385d705d84999a96ca423ff52003b/FLAG017c1ef59 [2025-03-09 04:36:30,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85d5a9306/db0385d705d84999a96ca423ff52003b [2025-03-09 04:36:30,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 04:36:30,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 04:36:30,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 04:36:30,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 04:36:30,463 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 04:36:30,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:36:30" (1/1) ... [2025-03-09 04:36:30,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@186b46e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:30, skipping insertion in model container [2025-03-09 04:36:30,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 04:36:30" (1/1) ... [2025-03-09 04:36:30,505 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 04:36:31,116 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 04:36:31,123 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 04:36:31,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 04:36:31,261 INFO L204 MainTranslator]: Completed translation [2025-03-09 04:36:31,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31 WrapperNode [2025-03-09 04:36:31,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 04:36:31,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 04:36:31,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 04:36:31,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 04:36:31,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,283 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,295 INFO L138 Inliner]: procedures = 499, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 78 [2025-03-09 04:36:31,295 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 04:36:31,295 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 04:36:31,295 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 04:36:31,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 04:36:31,301 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,309 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-09 04:36:31,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,312 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,312 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,313 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,314 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 04:36:31,315 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 04:36:31,315 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 04:36:31,315 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 04:36:31,315 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (1/1) ... [2025-03-09 04:36:31,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 04:36:31,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 04:36:31,346 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) [2025-03-09 04:36:31,353 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 [2025-03-09 04:36:31,370 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2025-03-09 04:36:31,371 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2025-03-09 04:36:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2025-03-09 04:36:31,371 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2025-03-09 04:36:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 04:36:31,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 04:36:31,371 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 04:36:31,481 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 04:36:31,482 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 04:36:31,602 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2025-03-09 04:36:31,602 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 04:36:31,612 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 04:36:31,613 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 04:36:31,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:36:31 BoogieIcfgContainer [2025-03-09 04:36:31,613 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 04:36:31,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 04:36:31,619 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 04:36:31,622 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 04:36:31,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 04:36:30" (1/3) ... [2025-03-09 04:36:31,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d065494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:36:31, skipping insertion in model container [2025-03-09 04:36:31,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 04:36:31" (2/3) ... [2025-03-09 04:36:31,622 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d065494 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 04:36:31, skipping insertion in model container [2025-03-09 04:36:31,622 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:36:31" (3/3) ... [2025-03-09 04:36:31,623 INFO L128 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_17_good.i [2025-03-09 04:36:31,642 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 04:36:31,643 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG CWE190_Integer_Overflow__int_max_multiply_17_good.i that has 3 procedures, 57 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-03-09 04:36:31,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 04:36:31,692 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;@cacc87e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 04:36:31,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-09 04:36:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 04:36:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 04:36:31,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:31,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:31,702 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:31,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1006996017, now seen corresponding path program 1 times [2025-03-09 04:36:31,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:31,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834041854] [2025-03-09 04:36:31,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:31,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:31,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 04:36:31,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 04:36:31,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:31,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:31,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 04:36:31,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:31,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834041854] [2025-03-09 04:36:31,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834041854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:31,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:36:31,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 04:36:31,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98733335] [2025-03-09 04:36:31,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:31,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 04:36:31,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:31,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 04:36:31,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 04:36:31,960 INFO L87 Difference]: Start difference. First operand has 57 states, 37 states have (on average 1.5405405405405406) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:36:31,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:31,993 INFO L93 Difference]: Finished difference Result 110 states and 129 transitions. [2025-03-09 04:36:31,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 04:36:31,998 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2025-03-09 04:36:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:32,002 INFO L225 Difference]: With dead ends: 110 [2025-03-09 04:36:32,002 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 04:36:32,006 INFO L434 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 [2025-03-09 04:36:32,008 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:32,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 185 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:32,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 04:36:32,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 04:36:32,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.542857142857143) internal successors, (54), 47 states have internal predecessors, (54), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 04:36:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 62 transitions. [2025-03-09 04:36:32,037 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 62 transitions. Word has length 10 [2025-03-09 04:36:32,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:32,038 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 62 transitions. [2025-03-09 04:36:32,038 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:36:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 62 transitions. [2025-03-09 04:36:32,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 04:36:32,039 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:32,039 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:32,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 04:36:32,039 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:32,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:32,040 INFO L85 PathProgramCache]: Analyzing trace with hash 928243078, now seen corresponding path program 1 times [2025-03-09 04:36:32,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:32,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756180752] [2025-03-09 04:36:32,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:32,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:32,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 04:36:32,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 04:36:32,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:32,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 04:36:32,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:32,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756180752] [2025-03-09 04:36:32,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756180752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 04:36:32,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127844028] [2025-03-09 04:36:32,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:32,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 04:36:32,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 04:36:32,160 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) [2025-03-09 04:36:32,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 04:36:32,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 04:36:32,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 04:36:32,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:32,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:32,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 04:36:32,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 04:36:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 04:36:32,276 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 04:36:32,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127844028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:32,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 04:36:32,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 04:36:32,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613974042] [2025-03-09 04:36:32,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:32,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 04:36:32,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:32,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 04:36:32,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 04:36:32,279 INFO L87 Difference]: Start difference. First operand 53 states and 62 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:36:32,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:32,305 INFO L93 Difference]: Finished difference Result 95 states and 112 transitions. [2025-03-09 04:36:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 04:36:32,306 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-09 04:36:32,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:32,306 INFO L225 Difference]: With dead ends: 95 [2025-03-09 04:36:32,306 INFO L226 Difference]: Without dead ends: 49 [2025-03-09 04:36:32,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 04:36:32,307 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:32,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:32,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-09 04:36:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-09 04:36:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 43 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 04:36:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2025-03-09 04:36:32,312 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 13 [2025-03-09 04:36:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:32,312 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2025-03-09 04:36:32,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:36:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2025-03-09 04:36:32,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 04:36:32,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:32,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:32,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 04:36:32,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 04:36:32,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:32,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:32,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2009630999, now seen corresponding path program 1 times [2025-03-09 04:36:32,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:32,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391890890] [2025-03-09 04:36:32,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:32,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:32,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 04:36:32,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 04:36:32,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:32,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:32,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 04:36:32,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:32,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391890890] [2025-03-09 04:36:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391890890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:36:32,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 04:36:32,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015305419] [2025-03-09 04:36:32,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:32,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:36:32,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:32,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:36:32,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:36:32,577 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:36:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:32,591 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2025-03-09 04:36:32,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:36:32,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-09 04:36:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:32,592 INFO L225 Difference]: With dead ends: 84 [2025-03-09 04:36:32,592 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 04:36:32,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:36:32,593 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:32,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 78 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:32,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 04:36:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 04:36:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 30 states have (on average 1.4) internal successors, (42), 37 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 04:36:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-09 04:36:32,599 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 16 [2025-03-09 04:36:32,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:32,599 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-09 04:36:32,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:36:32,599 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-09 04:36:32,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 04:36:32,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:32,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:32,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 04:36:32,600 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:32,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:32,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2009616070, now seen corresponding path program 1 times [2025-03-09 04:36:32,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:32,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735647935] [2025-03-09 04:36:32,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:32,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:32,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 04:36:32,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 04:36:32,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:32,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:32,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 04:36:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735647935] [2025-03-09 04:36:32,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735647935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:32,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:36:32,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 04:36:32,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373795926] [2025-03-09 04:36:32,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:32,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:36:32,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:32,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:36:32,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:36:32,651 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:36:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:32,671 INFO L93 Difference]: Finished difference Result 70 states and 79 transitions. [2025-03-09 04:36:32,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:36:32,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-03-09 04:36:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:32,672 INFO L225 Difference]: With dead ends: 70 [2025-03-09 04:36:32,672 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 04:36:32,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:36:32,673 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:32,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 87 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:32,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 04:36:32,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2025-03-09 04:36:32,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 04:36:32,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-09 04:36:32,677 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 16 [2025-03-09 04:36:32,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:32,678 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-09 04:36:32,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 04:36:32,678 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-09 04:36:32,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 04:36:32,678 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:32,678 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:32,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 04:36:32,679 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:32,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:32,679 INFO L85 PathProgramCache]: Analyzing trace with hash 496759873, now seen corresponding path program 1 times [2025-03-09 04:36:32,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:32,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403087445] [2025-03-09 04:36:32,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:32,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:32,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 04:36:32,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 04:36:32,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:32,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:32,730 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 04:36:32,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:32,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403087445] [2025-03-09 04:36:32,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403087445] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:32,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:36:32,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 04:36:32,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147183415] [2025-03-09 04:36:32,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:32,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 04:36:32,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:32,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 04:36:32,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 04:36:32,732 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 04:36:32,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:32,747 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2025-03-09 04:36:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 04:36:32,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-09 04:36:32,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:32,748 INFO L225 Difference]: With dead ends: 52 [2025-03-09 04:36:32,748 INFO L226 Difference]: Without dead ends: 50 [2025-03-09 04:36:32,749 INFO L434 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 [2025-03-09 04:36:32,749 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 1 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:32,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 124 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:32,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-09 04:36:32,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-03-09 04:36:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 43 states have internal predecessors, (48), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 04:36:32,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 56 transitions. [2025-03-09 04:36:32,752 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 56 transitions. Word has length 22 [2025-03-09 04:36:32,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:32,753 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 56 transitions. [2025-03-09 04:36:32,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 04:36:32,753 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2025-03-09 04:36:32,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 04:36:32,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:32,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:32,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 04:36:32,753 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:32,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:32,754 INFO L85 PathProgramCache]: Analyzing trace with hash -118914641, now seen corresponding path program 1 times [2025-03-09 04:36:32,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:32,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236360292] [2025-03-09 04:36:32,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:32,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:32,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 04:36:32,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 04:36:32,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:32,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:32,792 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 04:36:32,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:32,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236360292] [2025-03-09 04:36:32,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236360292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:32,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:36:32,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 04:36:32,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714830084] [2025-03-09 04:36:32,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:32,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 04:36:32,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:32,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 04:36:32,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 04:36:32,793 INFO L87 Difference]: Start difference. First operand 50 states and 56 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:36:32,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:32,806 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2025-03-09 04:36:32,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 04:36:32,809 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2025-03-09 04:36:32,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:32,810 INFO L225 Difference]: With dead ends: 71 [2025-03-09 04:36:32,810 INFO L226 Difference]: Without dead ends: 53 [2025-03-09 04:36:32,810 INFO L434 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 [2025-03-09 04:36:32,810 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:32,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:32,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2025-03-09 04:36:32,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2025-03-09 04:36:32,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 46 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 04:36:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-03-09 04:36:32,815 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 27 [2025-03-09 04:36:32,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:32,816 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-03-09 04:36:32,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:36:32,816 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-03-09 04:36:32,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 04:36:32,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:32,816 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:32,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 04:36:32,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:32,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:32,817 INFO L85 PathProgramCache]: Analyzing trace with hash 761947309, now seen corresponding path program 1 times [2025-03-09 04:36:32,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:32,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464938111] [2025-03-09 04:36:32,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:32,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:32,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 04:36:32,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 04:36:32,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:32,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 04:36:32,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464938111] [2025-03-09 04:36:32,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464938111] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 04:36:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073307691] [2025-03-09 04:36:32,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:32,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 04:36:32,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 04:36:32,875 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) [2025-03-09 04:36:32,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 04:36:32,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 04:36:32,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 04:36:32,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:32,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:32,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 04:36:32,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 04:36:32,955 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 04:36:32,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 04:36:32,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1073307691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:32,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 04:36:32,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 04:36:32,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326718721] [2025-03-09 04:36:32,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:32,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 04:36:32,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:32,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 04:36:32,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 04:36:32,956 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:36:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:32,969 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2025-03-09 04:36:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 04:36:32,970 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-09 04:36:32,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:32,971 INFO L225 Difference]: With dead ends: 70 [2025-03-09 04:36:32,971 INFO L226 Difference]: Without dead ends: 49 [2025-03-09 04:36:32,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 04:36:32,971 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:32,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:32,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-03-09 04:36:32,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2025-03-09 04:36:32,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 42 states have internal predecessors, (46), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 04:36:32,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-03-09 04:36:32,975 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 30 [2025-03-09 04:36:32,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:32,976 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-03-09 04:36:32,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:36:32,976 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-03-09 04:36:32,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 04:36:32,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:32,976 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:32,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 04:36:33,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 04:36:33,179 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:33,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:33,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1024796426, now seen corresponding path program 1 times [2025-03-09 04:36:33,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:33,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135201852] [2025-03-09 04:36:33,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:33,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:33,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 04:36:33,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 04:36:33,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:33,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:33,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-09 04:36:33,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:33,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135201852] [2025-03-09 04:36:33,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135201852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 04:36:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617399438] [2025-03-09 04:36:33,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:33,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 04:36:33,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 04:36:33,261 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 04:36:33,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 04:36:33,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 04:36:33,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 04:36:33,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:33,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:33,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 04:36:33,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 04:36:33,350 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 04:36:33,350 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 04:36:33,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617399438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:33,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 04:36:33,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 04:36:33,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177647255] [2025-03-09 04:36:33,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:33,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 04:36:33,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:33,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 04:36:33,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 04:36:33,351 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 04:36:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:33,380 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2025-03-09 04:36:33,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 04:36:33,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-03-09 04:36:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:33,382 INFO L225 Difference]: With dead ends: 75 [2025-03-09 04:36:33,382 INFO L226 Difference]: Without dead ends: 41 [2025-03-09 04:36:33,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 04:36:33,383 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:33,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:33,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-03-09 04:36:33,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-03-09 04:36:33,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 32 states have (on average 1.1875) internal successors, (38), 35 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 04:36:33,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2025-03-09 04:36:33,386 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 33 [2025-03-09 04:36:33,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:33,387 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2025-03-09 04:36:33,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 04:36:33,387 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2025-03-09 04:36:33,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-09 04:36:33,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:33,387 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:33,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 04:36:33,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 04:36:33,588 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:33,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2086769643, now seen corresponding path program 1 times [2025-03-09 04:36:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:33,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397714754] [2025-03-09 04:36:33,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:33,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:33,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 04:36:33,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 04:36:33,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:33,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:33,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 04:36:33,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:33,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397714754] [2025-03-09 04:36:33,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397714754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:33,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:36:33,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 04:36:33,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231723619] [2025-03-09 04:36:33,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:33,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 04:36:33,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:33,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 04:36:33,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 04:36:33,650 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:36:33,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:33,668 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2025-03-09 04:36:33,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 04:36:33,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-09 04:36:33,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:33,669 INFO L225 Difference]: With dead ends: 55 [2025-03-09 04:36:33,669 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 04:36:33,670 INFO L434 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 [2025-03-09 04:36:33,670 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 8 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:33,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 63 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 04:36:33,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-09 04:36:33,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.09375) internal successors, (35), 33 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 04:36:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2025-03-09 04:36:33,675 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 32 [2025-03-09 04:36:33,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:33,676 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2025-03-09 04:36:33,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 04:36:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2025-03-09 04:36:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 04:36:33,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:33,677 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:33,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 04:36:33,677 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:33,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1995471801, now seen corresponding path program 1 times [2025-03-09 04:36:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:33,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142590706] [2025-03-09 04:36:33,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:33,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:33,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 04:36:33,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 04:36:33,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:33,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:33,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 04:36:33,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:33,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142590706] [2025-03-09 04:36:33,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142590706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:33,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 04:36:33,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 04:36:33,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064205197] [2025-03-09 04:36:33,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:33,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 04:36:33,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:33,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 04:36:33,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 04:36:33,726 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 04:36:33,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:33,741 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2025-03-09 04:36:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 04:36:33,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2025-03-09 04:36:33,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:33,744 INFO L225 Difference]: With dead ends: 50 [2025-03-09 04:36:33,746 INFO L226 Difference]: Without dead ends: 48 [2025-03-09 04:36:33,746 INFO L434 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 [2025-03-09 04:36:33,746 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:33,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 106 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:33,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-09 04:36:33,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2025-03-09 04:36:33,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.075) internal successors, (43), 41 states have internal predecessors, (43), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 04:36:33,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2025-03-09 04:36:33,752 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 40 [2025-03-09 04:36:33,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:33,752 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2025-03-09 04:36:33,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.333333333333334) internal successors, (31), 4 states have internal predecessors, (31), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-09 04:36:33,752 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2025-03-09 04:36:33,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-09 04:36:33,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 04:36:33,755 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:33,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 04:36:33,756 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2025-03-09 04:36:33,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 04:36:33,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1610629070, now seen corresponding path program 1 times [2025-03-09 04:36:33,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 04:36:33,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654475044] [2025-03-09 04:36:33,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:33,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 04:36:33,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 04:36:33,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 04:36:33,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:33,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-09 04:36:33,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 04:36:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654475044] [2025-03-09 04:36:33,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654475044] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 04:36:33,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684341758] [2025-03-09 04:36:33,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 04:36:33,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 04:36:33,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 04:36:33,848 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 04:36:33,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 04:36:33,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 04:36:33,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 04:36:33,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 04:36:33,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 04:36:33,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 04:36:33,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 04:36:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-09 04:36:33,944 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 04:36:33,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684341758] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 04:36:33,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 04:36:33,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 04:36:33,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668589272] [2025-03-09 04:36:33,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 04:36:33,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 04:36:33,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 04:36:33,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 04:36:33,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 04:36:33,945 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 04:36:33,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 04:36:33,962 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2025-03-09 04:36:33,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 04:36:33,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 52 [2025-03-09 04:36:33,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 04:36:33,963 INFO L225 Difference]: With dead ends: 52 [2025-03-09 04:36:33,963 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 04:36:33,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 04:36:33,964 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 04:36:33,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 04:36:33,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 04:36:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 04:36:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 04:36:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 04:36:33,966 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2025-03-09 04:36:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 04:36:33,966 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 04:36:33,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-09 04:36:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 04:36:33,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 04:36:33,968 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-09 04:36:33,969 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-09 04:36:33,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 04:36:34,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 04:36:34,180 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 04:36:34,182 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 04:36:34,234 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 04:36:34,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 04:36:34 BoogieIcfgContainer [2025-03-09 04:36:34,244 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 04:36:34,245 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 04:36:34,245 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 04:36:34,245 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 04:36:34,246 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 04:36:31" (3/4) ... [2025-03-09 04:36:34,247 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 04:36:34,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printLine [2025-03-09 04:36:34,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printIntLine [2025-03-09 04:36:34,254 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-09 04:36:34,254 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-09 04:36:34,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 04:36:34,322 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 04:36:34,322 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 04:36:34,322 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 04:36:34,323 INFO L158 Benchmark]: Toolchain (without parser) took 3865.09ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 47.8MB in the end (delta: 62.4MB). Peak memory consumption was 63.9MB. Max. memory is 16.1GB. [2025-03-09 04:36:34,324 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:36:34,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 802.68ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 52.6MB in the end (delta: 57.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-03-09 04:36:34,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.95ms. Allocated memory is still 142.6MB. Free memory was 52.6MB in the beginning and 50.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 04:36:34,324 INFO L158 Benchmark]: Boogie Preprocessor took 18.79ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 48.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 04:36:34,325 INFO L158 Benchmark]: IcfgBuilder took 298.53ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 102.9MB in the end (delta: -54.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2025-03-09 04:36:34,325 INFO L158 Benchmark]: TraceAbstraction took 2625.90ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 53.8MB in the end (delta: 48.4MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. [2025-03-09 04:36:34,326 INFO L158 Benchmark]: Witness Printer took 77.40ms. Allocated memory is still 142.6MB. Free memory was 53.8MB in the beginning and 47.8MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 04:36:34,328 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.25ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 802.68ms. Allocated memory is still 142.6MB. Free memory was 110.2MB in the beginning and 52.6MB in the end (delta: 57.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.95ms. Allocated memory is still 142.6MB. Free memory was 52.6MB in the beginning and 50.3MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.79ms. Allocated memory is still 142.6MB. Free memory was 50.3MB in the beginning and 48.8MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 298.53ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 102.9MB in the end (delta: -54.1MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2625.90ms. Allocated memory is still 142.6MB. Free memory was 102.2MB in the beginning and 53.8MB in the end (delta: 48.4MB). Peak memory consumption was 41.6MB. Max. memory is 16.1GB. * Witness Printer took 77.40ms. Allocated memory is still 142.6MB. Free memory was 53.8MB in the beginning and 47.8MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. 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 - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1582]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1586]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1578]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1563]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 57 locations, 72 edges, 12 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 11, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 25 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 1384 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 895 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 144 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 489 mSDtfsCounter, 144 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 164 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 404 ConstructedInterpolants, 0 QuantifiedInterpolants, 570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 117/121 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1553]: Location Invariant Derived location invariant: (((1 <= i) && (2147483647 <= data)) || (i == 0)) - InvariantResult [Line: 1557]: Location Invariant Derived location invariant: (((k == 0) && (2147483647 <= data)) || ((1 <= k) && (2147483647 <= data))) - InvariantResult [Line: 1582]: Location Invariant Derived location invariant: (((1 <= j) && (data == 2)) || ((j == 0) && (data == 2))) - InvariantResult [Line: 1578]: Location Invariant Derived location invariant: (((1 <= h) && (data == 2)) || (h == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-09 04:36:34,343 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE