./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c -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 06d48bd39a18f705c3286a70a8cdcced2226e3b2a16c7a38c85f5398d4bcad34 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 14:47:40,026 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 14:47:40,084 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-17 14:47:40,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 14:47:40,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 14:47:40,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 14:47:40,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 14:47:40,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 14:47:40,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 14:47:40,107 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 14:47:40,107 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 14:47:40,107 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 14:47:40,107 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 14:47:40,107 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 14:47:40,107 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 14:47:40,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 14:47:40,108 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 14:47:40,108 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:47:40,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 14:47:40,109 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 14:47:40,109 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 -> 06d48bd39a18f705c3286a70a8cdcced2226e3b2a16c7a38c85f5398d4bcad34 [2025-03-17 14:47:40,484 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 14:47:40,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 14:47:40,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 14:47:40,498 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 14:47:40,498 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 14:47:40,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c [2025-03-17 14:47:41,672 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf825a79/7d411f4998ff4538a980d6c55d36032d/FLAG2678aa4f1 [2025-03-17 14:47:41,878 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 14:47:41,878 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/GopanReps-CAV2006-Fig1a.c [2025-03-17 14:47:41,891 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf825a79/7d411f4998ff4538a980d6c55d36032d/FLAG2678aa4f1 [2025-03-17 14:47:42,239 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbf825a79/7d411f4998ff4538a980d6c55d36032d [2025-03-17 14:47:42,241 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 14:47:42,242 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 14:47:42,243 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 14:47:42,243 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 14:47:42,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 14:47:42,247 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7b0cca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42, skipping insertion in model container [2025-03-17 14:47:42,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,256 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 14:47:42,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:47:42,345 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 14:47:42,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 14:47:42,363 INFO L204 MainTranslator]: Completed translation [2025-03-17 14:47:42,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42 WrapperNode [2025-03-17 14:47:42,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 14:47:42,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 14:47:42,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 14:47:42,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 14:47:42,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,382 INFO L138 Inliner]: procedures = 4, calls = 2, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2025-03-17 14:47:42,383 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 14:47:42,383 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 14:47:42,384 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 14:47:42,384 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 14:47:42,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,389 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,393 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-17 14:47:42,393 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,393 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 14:47:42,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 14:47:42,400 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 14:47:42,400 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 14:47:42,401 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (1/1) ... [2025-03-17 14:47:42,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 14:47:42,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:42,428 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-17 14:47:42,431 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-17 14:47:42,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 14:47:42,448 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 14:47:42,491 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 14:47:42,493 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 14:47:42,571 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-03-17 14:47:42,572 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 14:47:42,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 14:47:42,581 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 14:47:42,581 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:42 BoogieIcfgContainer [2025-03-17 14:47:42,581 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 14:47:42,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 14:47:42,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 14:47:42,589 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 14:47:42,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 02:47:42" (1/3) ... [2025-03-17 14:47:42,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528726f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:42, skipping insertion in model container [2025-03-17 14:47:42,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 02:47:42" (2/3) ... [2025-03-17 14:47:42,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@528726f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 02:47:42, skipping insertion in model container [2025-03-17 14:47:42,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:42" (3/3) ... [2025-03-17 14:47:42,591 INFO L128 eAbstractionObserver]: Analyzing ICFG GopanReps-CAV2006-Fig1a.c [2025-03-17 14:47:42,601 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 14:47:42,602 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG GopanReps-CAV2006-Fig1a.c that has 1 procedures, 17 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-17 14:47:42,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 14:47:42,645 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;@ba1be80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 14:47:42,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 14:47:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 10 states have (on average 1.8) internal successors, (18), 16 states have internal predecessors, (18), 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-17 14:47:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 14:47:42,652 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:42,652 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 14:47:42,652 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:42,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:42,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1415003, now seen corresponding path program 1 times [2025-03-17 14:47:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:42,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442332894] [2025-03-17 14:47:42,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:42,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:42,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 14:47:42,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 14:47:42,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:42,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:42,752 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-17 14:47:42,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:42,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442332894] [2025-03-17 14:47:42,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442332894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:42,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:42,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:47:42,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53013627] [2025-03-17 14:47:42,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:42,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:47:42,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:42,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:47:42,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:42,770 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.8) internal successors, (18), 16 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:42,799 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2025-03-17 14:47:42,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:47:42,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 14:47:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:42,805 INFO L225 Difference]: With dead ends: 24 [2025-03-17 14:47:42,805 INFO L226 Difference]: Without dead ends: 18 [2025-03-17 14:47:42,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 14:47:42,809 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 7 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:42,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:42,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-17 14:47:42,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2025-03-17 14:47:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2025-03-17 14:47:42,828 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 4 [2025-03-17 14:47:42,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:42,828 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2025-03-17 14:47:42,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2025-03-17 14:47:42,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 14:47:42,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:42,828 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 14:47:42,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 14:47:42,829 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:42,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:42,830 INFO L85 PathProgramCache]: Analyzing trace with hash 43865068, now seen corresponding path program 1 times [2025-03-17 14:47:42,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:42,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686973980] [2025-03-17 14:47:42,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:42,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:42,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 14:47:42,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 14:47:42,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:42,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:42,849 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-17 14:47:42,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:42,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686973980] [2025-03-17 14:47:42,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686973980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:42,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:42,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:47:42,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315384783] [2025-03-17 14:47:42,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:42,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:47:42,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:42,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:47:42,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:42,850 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:42,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:42,872 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2025-03-17 14:47:42,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:47:42,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 14:47:42,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:42,873 INFO L225 Difference]: With dead ends: 25 [2025-03-17 14:47:42,873 INFO L226 Difference]: Without dead ends: 23 [2025-03-17 14:47:42,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 14:47:42,874 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 6 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:42,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:42,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-17 14:47:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2025-03-17 14:47:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.4705882352941178) internal successors, (25), 20 states have internal predecessors, (25), 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-17 14:47:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-17 14:47:42,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 5 [2025-03-17 14:47:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:42,877 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-17 14:47:42,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-17 14:47:42,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 14:47:42,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:42,877 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 14:47:42,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 14:47:42,878 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:42,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:42,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1359817081, now seen corresponding path program 1 times [2025-03-17 14:47:42,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:42,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706171722] [2025-03-17 14:47:42,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:42,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:42,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 14:47:42,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 14:47:42,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:42,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:42,901 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-17 14:47:42,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:42,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706171722] [2025-03-17 14:47:42,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706171722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:42,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:42,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:47:42,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314688050] [2025-03-17 14:47:42,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:42,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:47:42,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:42,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:47:42,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:42,902 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 14:47:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:42,916 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2025-03-17 14:47:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:47:42,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-17 14:47:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:42,917 INFO L225 Difference]: With dead ends: 21 [2025-03-17 14:47:42,917 INFO L226 Difference]: Without dead ends: 20 [2025-03-17 14:47:42,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 14:47:42,918 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:42,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 8 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-17 14:47:42,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-17 14:47:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2025-03-17 14:47:42,921 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 6 [2025-03-17 14:47:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:42,921 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2025-03-17 14:47:42,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-17 14:47:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2025-03-17 14:47:42,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 14:47:42,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:42,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 14:47:42,922 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash -795343478, now seen corresponding path program 1 times [2025-03-17 14:47:42,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:42,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762118534] [2025-03-17 14:47:42,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:42,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 14:47:42,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 14:47:42,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:42,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:42,944 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-17 14:47:42,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:42,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762118534] [2025-03-17 14:47:42,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762118534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:42,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:42,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 14:47:42,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042862400] [2025-03-17 14:47:42,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:42,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:47:42,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:42,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:47:42,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:42,946 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 14:47:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:42,959 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2025-03-17 14:47:42,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:47:42,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 14:47:42,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:42,960 INFO L225 Difference]: With dead ends: 37 [2025-03-17 14:47:42,960 INFO L226 Difference]: Without dead ends: 18 [2025-03-17 14:47:42,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 14:47:42,961 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:42,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:42,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-17 14:47:42,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-17 14:47:42,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 17 states have internal predecessors, (19), 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-17 14:47:42,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-03-17 14:47:42,966 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 7 [2025-03-17 14:47:42,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:42,967 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-03-17 14:47:42,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-17 14:47:42,967 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-03-17 14:47:42,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 14:47:42,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:42,968 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 14:47:42,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 14:47:42,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:42,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:42,969 INFO L85 PathProgramCache]: Analyzing trace with hash 312417350, now seen corresponding path program 1 times [2025-03-17 14:47:42,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:42,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371430752] [2025-03-17 14:47:42,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:42,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:42,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:47:42,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:47:42,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:42,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:43,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:43,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:43,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371430752] [2025-03-17 14:47:43,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371430752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:43,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467180372] [2025-03-17 14:47:43,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:43,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:43,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:43,022 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-17 14:47:43,023 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-17 14:47:43,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 14:47:43,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 14:47:43,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:43,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:43,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:47:43,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:43,080 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:43,080 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:43,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:43,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467180372] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:43,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:43,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-17 14:47:43,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420055857] [2025-03-17 14:47:43,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:43,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:47:43,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:43,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:47:43,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:47:43,124 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-17 14:47:43,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:43,177 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2025-03-17 14:47:43,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:47:43,178 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 14:47:43,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:43,178 INFO L225 Difference]: With dead ends: 56 [2025-03-17 14:47:43,179 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 14:47:43,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:47:43,180 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:43,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 32 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:43,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 14:47:43,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2025-03-17 14:47:43,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 45 states have internal predecessors, (55), 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-17 14:47:43,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2025-03-17 14:47:43,185 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 11 [2025-03-17 14:47:43,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:43,186 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2025-03-17 14:47:43,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 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-17 14:47:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2025-03-17 14:47:43,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:47:43,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:43,186 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2025-03-17 14:47:43,192 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-17 14:47:43,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:43,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:43,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:43,390 INFO L85 PathProgramCache]: Analyzing trace with hash -414638236, now seen corresponding path program 1 times [2025-03-17 14:47:43,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:43,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915680936] [2025-03-17 14:47:43,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:43,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:43,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:47:43,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:47:43,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:43,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 14:47:43,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:43,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915680936] [2025-03-17 14:47:43,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915680936] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:47:43,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:47:43,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 14:47:43,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182756267] [2025-03-17 14:47:43,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:47:43,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 14:47:43,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:43,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 14:47:43,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 14:47:43,425 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-17 14:47:43,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:43,440 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-03-17 14:47:43,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 14:47:43,441 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 14:47:43,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:43,442 INFO L225 Difference]: With dead ends: 51 [2025-03-17 14:47:43,442 INFO L226 Difference]: Without dead ends: 50 [2025-03-17 14:47:43,442 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-17 14:47:43,443 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:43,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-17 14:47:43,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2025-03-17 14:47:43,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 45 states have internal predecessors, (53), 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-17 14:47:43,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2025-03-17 14:47:43,449 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 13 [2025-03-17 14:47:43,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:43,449 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2025-03-17 14:47:43,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 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-17 14:47:43,450 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2025-03-17 14:47:43,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-17 14:47:43,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:43,450 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 14:47:43,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 14:47:43,450 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:43,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:43,452 INFO L85 PathProgramCache]: Analyzing trace with hash -413591707, now seen corresponding path program 1 times [2025-03-17 14:47:43,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:43,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578824227] [2025-03-17 14:47:43,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:43,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:43,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:47:43,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:47:43,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:43,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:43,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:43,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578824227] [2025-03-17 14:47:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578824227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805797005] [2025-03-17 14:47:43,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 14:47:43,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:43,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:43,487 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-17 14:47:43,489 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-17 14:47:43,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-17 14:47:43,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-17 14:47:43,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:43,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:43,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 14:47:43,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:43,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:43,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:43,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805797005] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:43,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:43,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 2, 2] total 5 [2025-03-17 14:47:43,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461591966] [2025-03-17 14:47:43,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:43,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 14:47:43,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:43,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 14:47:43,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:47:43,557 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-17 14:47:43,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:43,601 INFO L93 Difference]: Finished difference Result 102 states and 120 transitions. [2025-03-17 14:47:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 14:47:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-17 14:47:43,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:43,602 INFO L225 Difference]: With dead ends: 102 [2025-03-17 14:47:43,602 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 14:47:43,603 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 14:47:43,603 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:43,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:43,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 14:47:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2025-03-17 14:47:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.2) internal successors, (66), 57 states have internal predecessors, (66), 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-17 14:47:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-03-17 14:47:43,607 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 13 [2025-03-17 14:47:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:43,607 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-17 14:47:43,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 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-17 14:47:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2025-03-17 14:47:43,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 14:47:43,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:43,607 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 1, 1] [2025-03-17 14:47:43,613 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-17 14:47:43,808 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-17 14:47:43,808 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:43,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:43,808 INFO L85 PathProgramCache]: Analyzing trace with hash -20451244, now seen corresponding path program 2 times [2025-03-17 14:47:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:43,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454435278] [2025-03-17 14:47:43,809 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:47:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:43,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:47:43,818 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:47:43,818 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:47:43,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:43,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:43,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454435278] [2025-03-17 14:47:43,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454435278] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:43,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053494757] [2025-03-17 14:47:43,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:47:43,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:43,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:43,921 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-17 14:47:43,923 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-17 14:47:43,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 14:47:43,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 14:47:43,947 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:47:43,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:43,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 14:47:43,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:44,002 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:44,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:44,092 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:44,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053494757] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:44,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:44,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-17 14:47:44,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950311652] [2025-03-17 14:47:44,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:44,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 14:47:44,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:44,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 14:47:44,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:47:44,093 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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-17 14:47:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:44,186 INFO L93 Difference]: Finished difference Result 234 states and 289 transitions. [2025-03-17 14:47:44,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 14:47:44,186 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 14:47:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:44,188 INFO L225 Difference]: With dead ends: 234 [2025-03-17 14:47:44,188 INFO L226 Difference]: Without dead ends: 232 [2025-03-17 14:47:44,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2025-03-17 14:47:44,188 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 61 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:44,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 62 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:47:44,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-17 14:47:44,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 164. [2025-03-17 14:47:44,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 161 states have (on average 1.186335403726708) internal successors, (191), 163 states have internal predecessors, (191), 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-17 14:47:44,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2025-03-17 14:47:44,203 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 29 [2025-03-17 14:47:44,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:44,203 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2025-03-17 14:47:44,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 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-17 14:47:44,203 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2025-03-17 14:47:44,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 14:47:44,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:44,204 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1] [2025-03-17 14:47:44,209 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-17 14:47:44,404 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-17 14:47:44,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:44,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:44,405 INFO L85 PathProgramCache]: Analyzing trace with hash 599348020, now seen corresponding path program 2 times [2025-03-17 14:47:44,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:44,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033484851] [2025-03-17 14:47:44,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:47:44,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:44,409 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 14:47:44,412 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:47:44,412 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:47:44,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:44,472 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:47:44,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033484851] [2025-03-17 14:47:44,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033484851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:44,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316331246] [2025-03-17 14:47:44,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:47:44,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:44,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:44,474 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-17 14:47:44,475 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-17 14:47:44,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-17 14:47:44,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 14:47:44,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:47:44,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:44,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 14:47:44,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:44,527 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:47:44,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:44,576 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 14:47:44,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316331246] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:44,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:44,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-17 14:47:44,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29596314] [2025-03-17 14:47:44,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:44,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 14:47:44,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:44,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 14:47:44,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:47:44,578 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 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-17 14:47:44,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:44,620 INFO L93 Difference]: Finished difference Result 275 states and 321 transitions. [2025-03-17 14:47:44,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 14:47:44,621 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-17 14:47:44,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:44,622 INFO L225 Difference]: With dead ends: 275 [2025-03-17 14:47:44,622 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 14:47:44,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-17 14:47:44,623 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:44,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 39 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:44,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 14:47:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-03-17 14:47:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 123 states have (on average 1.1382113821138211) internal successors, (140), 125 states have internal predecessors, (140), 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-17 14:47:44,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 140 transitions. [2025-03-17 14:47:44,635 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 140 transitions. Word has length 31 [2025-03-17 14:47:44,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:44,635 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 140 transitions. [2025-03-17 14:47:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 9 states have internal predecessors, (49), 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-17 14:47:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 140 transitions. [2025-03-17 14:47:44,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-17 14:47:44,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:44,636 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 9, 8, 8, 8, 2, 2, 2, 1, 1] [2025-03-17 14:47:44,645 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-17 14:47:44,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:44,843 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:44,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:44,843 INFO L85 PathProgramCache]: Analyzing trace with hash 711981942, now seen corresponding path program 3 times [2025-03-17 14:47:44,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:44,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826212585] [2025-03-17 14:47:44,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:47:44,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:44,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 10 equivalence classes. [2025-03-17 14:47:44,853 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 61 statements. [2025-03-17 14:47:44,853 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 14:47:44,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:44,886 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-17 14:47:44,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826212585] [2025-03-17 14:47:44,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826212585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:44,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808596216] [2025-03-17 14:47:44,887 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:47:44,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:44,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:44,889 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:44,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 14:47:44,918 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 61 statements into 10 equivalence classes. [2025-03-17 14:47:44,924 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 25 of 61 statements. [2025-03-17 14:47:44,924 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-17 14:47:44,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:44,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 14:47:44,926 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:44,948 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-17 14:47:44,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:44,987 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 88 proven. 10 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-17 14:47:44,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808596216] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:44,987 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:44,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 14:47:44,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596567068] [2025-03-17 14:47:44,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:44,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 14:47:44,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:44,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 14:47:44,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:47:44,988 INFO L87 Difference]: Start difference. First operand 126 states and 140 transitions. Second operand has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-17 14:47:45,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:45,017 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2025-03-17 14:47:45,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 14:47:45,017 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-17 14:47:45,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:45,018 INFO L225 Difference]: With dead ends: 190 [2025-03-17 14:47:45,018 INFO L226 Difference]: Without dead ends: 189 [2025-03-17 14:47:45,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-17 14:47:45,018 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:45,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 33 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:45,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-17 14:47:45,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 184. [2025-03-17 14:47:45,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 181 states have (on average 1.1657458563535912) internal successors, (211), 183 states have internal predecessors, (211), 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-17 14:47:45,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 211 transitions. [2025-03-17 14:47:45,030 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 211 transitions. Word has length 61 [2025-03-17 14:47:45,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:45,030 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 211 transitions. [2025-03-17 14:47:45,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.857142857142857) internal successors, (41), 8 states have internal predecessors, (41), 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-17 14:47:45,030 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 211 transitions. [2025-03-17 14:47:45,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 14:47:45,038 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:45,039 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 1, 1] [2025-03-17 14:47:45,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 14:47:45,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 14:47:45,239 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:45,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash -1884192272, now seen corresponding path program 3 times [2025-03-17 14:47:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:45,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891910320] [2025-03-17 14:47:45,240 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:47:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:45,245 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 11 equivalence classes. [2025-03-17 14:47:45,255 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 14:47:45,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:47:45,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:45,413 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:45,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:45,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891910320] [2025-03-17 14:47:45,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891910320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:45,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711814985] [2025-03-17 14:47:45,414 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:47:45,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:45,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:45,417 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:45,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 14:47:45,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 11 equivalence classes. [2025-03-17 14:47:45,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 14:47:45,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-17 14:47:45,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:45,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 14:47:45,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:45,537 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:45,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:45,772 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:45,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711814985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:45,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:45,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-03-17 14:47:45,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607754071] [2025-03-17 14:47:45,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:45,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 14:47:45,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:45,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 14:47:45,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:47:45,774 INFO L87 Difference]: Start difference. First operand 184 states and 211 transitions. Second operand has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 23 states have internal predecessors, (130), 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-17 14:47:45,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:45,939 INFO L93 Difference]: Finished difference Result 1342 states and 1668 transitions. [2025-03-17 14:47:45,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 14:47:45,940 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 23 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-17 14:47:45,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:45,944 INFO L225 Difference]: With dead ends: 1342 [2025-03-17 14:47:45,944 INFO L226 Difference]: Without dead ends: 1340 [2025-03-17 14:47:45,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2025-03-17 14:47:45,945 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 127 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:45,945 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 132 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:47:45,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2025-03-17 14:47:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 736. [2025-03-17 14:47:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 736 states, 733 states have (on average 1.170532060027285) internal successors, (858), 735 states have internal predecessors, (858), 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-17 14:47:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 858 transitions. [2025-03-17 14:47:45,975 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 858 transitions. Word has length 65 [2025-03-17 14:47:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:45,975 INFO L471 AbstractCegarLoop]: Abstraction has 736 states and 858 transitions. [2025-03-17 14:47:45,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 5.6521739130434785) internal successors, (130), 23 states have internal predecessors, (130), 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-17 14:47:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 858 transitions. [2025-03-17 14:47:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 14:47:45,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:45,977 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 8, 8, 8, 6, 6, 6, 1, 1] [2025-03-17 14:47:45,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 14:47:46,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:46,179 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:46,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:46,179 INFO L85 PathProgramCache]: Analyzing trace with hash 332701026, now seen corresponding path program 4 times [2025-03-17 14:47:46,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:46,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929591710] [2025-03-17 14:47:46,180 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:47:46,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:46,192 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-03-17 14:47:46,197 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 14:47:46,197 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:47:46,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 186 proven. 184 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 14:47:46,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:46,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929591710] [2025-03-17 14:47:46,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929591710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:46,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111338865] [2025-03-17 14:47:46,336 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:47:46,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:46,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:46,338 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:46,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 14:47:46,358 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 85 statements into 2 equivalence classes. [2025-03-17 14:47:46,372 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 14:47:46,372 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:47:46,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:46,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 14:47:46,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 186 proven. 184 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 14:47:46,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 186 proven. 184 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 14:47:46,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1111338865] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:46,620 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:46,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2025-03-17 14:47:46,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434466519] [2025-03-17 14:47:46,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:46,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 14:47:46,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:46,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 14:47:46,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:47:46,621 INFO L87 Difference]: Start difference. First operand 736 states and 858 transitions. Second operand has 20 states, 20 states have (on average 5.45) internal successors, (109), 19 states have internal predecessors, (109), 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-17 14:47:46,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:46,711 INFO L93 Difference]: Finished difference Result 1161 states and 1359 transitions. [2025-03-17 14:47:46,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 14:47:46,712 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.45) internal successors, (109), 19 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2025-03-17 14:47:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:46,714 INFO L225 Difference]: With dead ends: 1161 [2025-03-17 14:47:46,715 INFO L226 Difference]: Without dead ends: 470 [2025-03-17 14:47:46,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2025-03-17 14:47:46,717 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:46,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 74 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:47:46,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-03-17 14:47:46,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-03-17 14:47:46,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 467 states have (on average 1.1477516059957173) internal successors, (536), 469 states have internal predecessors, (536), 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-17 14:47:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 536 transitions. [2025-03-17 14:47:46,738 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 536 transitions. Word has length 85 [2025-03-17 14:47:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:46,738 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 536 transitions. [2025-03-17 14:47:46,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.45) internal successors, (109), 19 states have internal predecessors, (109), 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-17 14:47:46,738 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 536 transitions. [2025-03-17 14:47:46,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-17 14:47:46,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:46,740 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 1, 1] [2025-03-17 14:47:46,747 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 14:47:46,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:46,941 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:46,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:46,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2110993624, now seen corresponding path program 4 times [2025-03-17 14:47:46,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:46,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006338725] [2025-03-17 14:47:46,941 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:47:46,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:46,951 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 137 statements into 2 equivalence classes. [2025-03-17 14:47:46,966 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 14:47:46,966 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:47:46,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:47,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:47,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:47,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006338725] [2025-03-17 14:47:47,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006338725] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:47,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692028560] [2025-03-17 14:47:47,491 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 14:47:47,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:47,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:47,493 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:47,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 14:47:47,515 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 137 statements into 2 equivalence classes. [2025-03-17 14:47:47,536 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 137 of 137 statements. [2025-03-17 14:47:47,537 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-17 14:47:47,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:47,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 14:47:47,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:47,685 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 0 proven. 1474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:48,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692028560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:48,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 46 [2025-03-17 14:47:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046501041] [2025-03-17 14:47:48,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:48,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-17 14:47:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:48,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-17 14:47:48,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:47:48,414 INFO L87 Difference]: Start difference. First operand 470 states and 536 transitions. Second operand has 48 states, 47 states have (on average 5.829787234042553) internal successors, (274), 47 states have internal predecessors, (274), 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-17 14:47:48,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:48,801 INFO L93 Difference]: Finished difference Result 5688 states and 6893 transitions. [2025-03-17 14:47:48,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 14:47:48,801 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 5.829787234042553) internal successors, (274), 47 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2025-03-17 14:47:48,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:48,818 INFO L225 Difference]: With dead ends: 5688 [2025-03-17 14:47:48,818 INFO L226 Difference]: Without dead ends: 5686 [2025-03-17 14:47:48,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 14:47:48,821 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 271 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:48,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 331 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:47:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5686 states. [2025-03-17 14:47:48,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5686 to 1756. [2025-03-17 14:47:48,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1756 states, 1753 states have (on average 1.1671420422133485) internal successors, (2046), 1755 states have internal predecessors, (2046), 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-17 14:47:48,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1756 states to 1756 states and 2046 transitions. [2025-03-17 14:47:48,915 INFO L78 Accepts]: Start accepts. Automaton has 1756 states and 2046 transitions. Word has length 137 [2025-03-17 14:47:48,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:48,915 INFO L471 AbstractCegarLoop]: Abstraction has 1756 states and 2046 transitions. [2025-03-17 14:47:48,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 5.829787234042553) internal successors, (274), 47 states have internal predecessors, (274), 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-17 14:47:48,916 INFO L276 IsEmpty]: Start isEmpty. Operand 1756 states and 2046 transitions. [2025-03-17 14:47:48,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 14:47:48,917 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:48,917 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 23, 18, 18, 18, 6, 6, 6, 1, 1] [2025-03-17 14:47:48,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 14:47:49,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 14:47:49,118 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:49,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:49,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1472060570, now seen corresponding path program 5 times [2025-03-17 14:47:49,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:49,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340726854] [2025-03-17 14:47:49,119 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:47:49,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:49,126 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 145 statements into 20 equivalence classes. [2025-03-17 14:47:49,149 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 14:47:49,149 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-17 14:47:49,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 406 proven. 954 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 14:47:49,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:49,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340726854] [2025-03-17 14:47:49,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340726854] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:49,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568201579] [2025-03-17 14:47:49,456 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:47:49,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:49,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:49,458 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:49,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 14:47:49,477 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 145 statements into 20 equivalence classes. [2025-03-17 14:47:49,502 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 14:47:49,502 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 20 check-sat command(s) [2025-03-17 14:47:49,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:49,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 14:47:49,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:49,604 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 406 proven. 954 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 14:47:49,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:50,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1440 backedges. 406 proven. 954 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 14:47:50,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568201579] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:50,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:50,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2025-03-17 14:47:50,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996363201] [2025-03-17 14:47:50,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:50,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 14:47:50,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:50,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 14:47:50,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 14:47:50,049 INFO L87 Difference]: Start difference. First operand 1756 states and 2046 transitions. Second operand has 40 states, 40 states have (on average 5.725) internal successors, (229), 39 states have internal predecessors, (229), 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-17 14:47:50,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:50,190 INFO L93 Difference]: Finished difference Result 2721 states and 3181 transitions. [2025-03-17 14:47:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-17 14:47:50,190 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 5.725) internal successors, (229), 39 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2025-03-17 14:47:50,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:50,194 INFO L225 Difference]: With dead ends: 2721 [2025-03-17 14:47:50,194 INFO L226 Difference]: Without dead ends: 1070 [2025-03-17 14:47:50,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 14:47:50,196 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:50,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 130 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:47:50,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-03-17 14:47:50,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1070. [2025-03-17 14:47:50,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1070 states, 1067 states have (on average 1.1433926897844424) internal successors, (1220), 1069 states have internal predecessors, (1220), 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-17 14:47:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1220 transitions. [2025-03-17 14:47:50,217 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1220 transitions. Word has length 145 [2025-03-17 14:47:50,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:50,217 INFO L471 AbstractCegarLoop]: Abstraction has 1070 states and 1220 transitions. [2025-03-17 14:47:50,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 5.725) internal successors, (229), 39 states have internal predecessors, (229), 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-17 14:47:50,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1220 transitions. [2025-03-17 14:47:50,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2025-03-17 14:47:50,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:50,219 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 43, 38, 38, 38, 6, 6, 6, 1, 1] [2025-03-17 14:47:50,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 14:47:50,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 14:47:50,424 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:50,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:50,425 INFO L85 PathProgramCache]: Analyzing trace with hash -802507410, now seen corresponding path program 6 times [2025-03-17 14:47:50,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:50,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218243339] [2025-03-17 14:47:50,425 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:47:50,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:50,433 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 265 statements into 40 equivalence classes. [2025-03-17 14:47:50,441 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 103 of 265 statements. [2025-03-17 14:47:50,441 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-17 14:47:50,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:50,518 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 1048 proven. 102 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2025-03-17 14:47:50,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218243339] [2025-03-17 14:47:50,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218243339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:50,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934032945] [2025-03-17 14:47:50,519 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:47:50,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:50,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:50,521 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:50,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 14:47:50,544 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 265 statements into 40 equivalence classes. [2025-03-17 14:47:50,561 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) and asserted 103 of 265 statements. [2025-03-17 14:47:50,562 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2025-03-17 14:47:50,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:50,563 INFO L256 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 14:47:50,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:50,604 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 1048 proven. 102 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2025-03-17 14:47:50,604 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 5220 backedges. 1048 proven. 102 refuted. 0 times theorem prover too weak. 4070 trivial. 0 not checked. [2025-03-17 14:47:50,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934032945] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:50,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:50,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2025-03-17 14:47:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762449600] [2025-03-17 14:47:50,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:50,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-17 14:47:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:50,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-17 14:47:50,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:47:50,698 INFO L87 Difference]: Start difference. First operand 1070 states and 1220 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:50,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:50,778 INFO L93 Difference]: Finished difference Result 1748 states and 2116 transitions. [2025-03-17 14:47:50,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 14:47:50,779 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 265 [2025-03-17 14:47:50,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:50,784 INFO L225 Difference]: With dead ends: 1748 [2025-03-17 14:47:50,784 INFO L226 Difference]: Without dead ends: 1747 [2025-03-17 14:47:50,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-17 14:47:50,785 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:50,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 65 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 14:47:50,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states. [2025-03-17 14:47:50,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1734. [2025-03-17 14:47:50,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1731 states have (on average 1.1554015020219526) internal successors, (2000), 1733 states have internal predecessors, (2000), 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-17 14:47:50,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2000 transitions. [2025-03-17 14:47:50,829 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2000 transitions. Word has length 265 [2025-03-17 14:47:50,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:50,829 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2000 transitions. [2025-03-17 14:47:50,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 14:47:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2000 transitions. [2025-03-17 14:47:50,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-17 14:47:50,834 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:50,835 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 46, 46, 46, 1, 1] [2025-03-17 14:47:50,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-17 14:47:51,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 14:47:51,035 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:51,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:51,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1371015784, now seen corresponding path program 5 times [2025-03-17 14:47:51,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:51,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424620099] [2025-03-17 14:47:51,036 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:47:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:51,044 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 281 statements into 47 equivalence classes. [2025-03-17 14:47:51,082 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 281 of 281 statements. [2025-03-17 14:47:51,082 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 14:47:51,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:52,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:52,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:52,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424620099] [2025-03-17 14:47:52,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424620099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:52,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1037346039] [2025-03-17 14:47:52,352 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 14:47:52,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:52,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:52,358 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:52,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-17 14:47:52,383 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 281 statements into 47 equivalence classes. [2025-03-17 14:47:52,443 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 281 of 281 statements. [2025-03-17 14:47:52,444 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-17 14:47:52,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:52,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-03-17 14:47:52,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:52,744 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 6394 backedges. 0 proven. 6394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:47:54,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1037346039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:54,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:54,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 94 [2025-03-17 14:47:54,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803747042] [2025-03-17 14:47:54,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:54,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-03-17 14:47:54,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:54,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-03-17 14:47:54,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 14:47:54,849 INFO L87 Difference]: Start difference. First operand 1734 states and 2000 transitions. Second operand has 96 states, 95 states have (on average 5.91578947368421) internal successors, (562), 95 states have internal predecessors, (562), 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-17 14:47:56,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:56,183 INFO L93 Difference]: Finished difference Result 41560 states and 49681 transitions. [2025-03-17 14:47:56,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2025-03-17 14:47:56,183 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 5.91578947368421) internal successors, (562), 95 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 281 [2025-03-17 14:47:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:56,265 INFO L225 Difference]: With dead ends: 41560 [2025-03-17 14:47:56,265 INFO L226 Difference]: Without dead ends: 41558 [2025-03-17 14:47:56,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 513 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 14:47:56,277 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 675 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 296 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1055 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:56,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 660 Invalid, 1055 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 14:47:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41558 states. [2025-03-17 14:47:56,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41558 to 7380. [2025-03-17 14:47:56,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7380 states, 7377 states have (on average 1.166598888437034) internal successors, (8606), 7379 states have internal predecessors, (8606), 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-17 14:47:56,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7380 states to 7380 states and 8606 transitions. [2025-03-17 14:47:56,979 INFO L78 Accepts]: Start accepts. Automaton has 7380 states and 8606 transitions. Word has length 281 [2025-03-17 14:47:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:56,979 INFO L471 AbstractCegarLoop]: Abstraction has 7380 states and 8606 transitions. [2025-03-17 14:47:56,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 5.91578947368421) internal successors, (562), 95 states have internal predecessors, (562), 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-17 14:47:56,980 INFO L276 IsEmpty]: Start isEmpty. Operand 7380 states and 8606 transitions. [2025-03-17 14:47:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2025-03-17 14:47:56,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:56,983 INFO L218 NwaCegarLoop]: trace histogram [52, 52, 51, 38, 38, 38, 14, 14, 14, 1, 1] [2025-03-17 14:47:56,991 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-17 14:47:57,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 14:47:57,184 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:57,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:57,185 INFO L85 PathProgramCache]: Analyzing trace with hash -713087674, now seen corresponding path program 7 times [2025-03-17 14:47:57,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:57,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440227608] [2025-03-17 14:47:57,185 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:47:57,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:57,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 14:47:57,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 14:47:57,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:57,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:58,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6892 backedges. 2078 proven. 4294 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-17 14:47:58,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:47:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440227608] [2025-03-17 14:47:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440227608] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:47:58,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1991258544] [2025-03-17 14:47:58,166 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 14:47:58,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:47:58,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:47:58,168 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:47:58,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-17 14:47:58,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 313 statements into 1 equivalence classes. [2025-03-17 14:47:58,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 313 of 313 statements. [2025-03-17 14:47:58,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 14:47:58,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:47:58,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-17 14:47:58,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:47:58,459 INFO L134 CoverageAnalysis]: Checked inductivity of 6892 backedges. 2078 proven. 4294 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-17 14:47:58,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:47:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6892 backedges. 2078 proven. 4294 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-03-17 14:47:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1991258544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:47:59,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:47:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 52 [2025-03-17 14:47:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511585900] [2025-03-17 14:47:59,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:47:59,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-03-17 14:47:59,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:47:59,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-03-17 14:47:59,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 14:47:59,401 INFO L87 Difference]: Start difference. First operand 7380 states and 8606 transitions. Second operand has 53 states, 53 states have (on average 5.886792452830188) internal successors, (312), 52 states have internal predecessors, (312), 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-17 14:47:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:47:59,600 INFO L93 Difference]: Finished difference Result 11079 states and 12944 transitions. [2025-03-17 14:47:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-17 14:47:59,600 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 5.886792452830188) internal successors, (312), 52 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 313 [2025-03-17 14:47:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:47:59,609 INFO L225 Difference]: With dead ends: 11079 [2025-03-17 14:47:59,609 INFO L226 Difference]: Without dead ends: 3924 [2025-03-17 14:47:59,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 664 GetRequests, 586 SyntacticMatches, 27 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2025-03-17 14:47:59,617 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 5 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 14:47:59,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 185 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 14:47:59,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3924 states. [2025-03-17 14:47:59,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3924 to 3924. [2025-03-17 14:47:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3924 states, 3921 states have (on average 1.160418260647794) internal successors, (4550), 3923 states have internal predecessors, (4550), 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-17 14:47:59,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3924 states to 3924 states and 4550 transitions. [2025-03-17 14:47:59,724 INFO L78 Accepts]: Start accepts. Automaton has 3924 states and 4550 transitions. Word has length 313 [2025-03-17 14:47:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:47:59,725 INFO L471 AbstractCegarLoop]: Abstraction has 3924 states and 4550 transitions. [2025-03-17 14:47:59,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 5.886792452830188) internal successors, (312), 52 states have internal predecessors, (312), 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-17 14:47:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 3924 states and 4550 transitions. [2025-03-17 14:47:59,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-17 14:47:59,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:47:59,730 INFO L218 NwaCegarLoop]: trace histogram [65, 65, 64, 51, 51, 51, 14, 14, 14, 1, 1] [2025-03-17 14:47:59,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 14:47:59,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 14:47:59,930 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:47:59,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:47:59,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1006285864, now seen corresponding path program 8 times [2025-03-17 14:47:59,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:47:59,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879526463] [2025-03-17 14:47:59,931 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:47:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:47:59,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 391 statements into 2 equivalence classes. [2025-03-17 14:47:59,980 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 391 of 391 statements. [2025-03-17 14:47:59,980 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:47:59,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 11052 backedges. 0 proven. 11052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879526463] [2025-03-17 14:48:02,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879526463] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303029638] [2025-03-17 14:48:02,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 14:48:02,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:02,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:02,068 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:02,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 14:48:02,092 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 391 statements into 2 equivalence classes. [2025-03-17 14:48:02,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 391 of 391 statements. [2025-03-17 14:48:02,139 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 14:48:02,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:02,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-03-17 14:48:02,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:02,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11052 backedges. 0 proven. 11052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:02,459 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:05,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11052 backedges. 0 proven. 11052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303029638] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:05,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:05,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 130 [2025-03-17 14:48:05,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804567259] [2025-03-17 14:48:05,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:05,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-03-17 14:48:05,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:05,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-03-17 14:48:05,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2025-03-17 14:48:05,910 INFO L87 Difference]: Start difference. First operand 3924 states and 4550 transitions. Second operand has 132 states, 131 states have (on average 5.969465648854962) internal successors, (782), 131 states have internal predecessors, (782), 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-17 14:48:07,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:07,656 INFO L93 Difference]: Finished difference Result 7836 states and 9736 transitions. [2025-03-17 14:48:07,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2025-03-17 14:48:07,657 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 131 states have (on average 5.969465648854962) internal successors, (782), 131 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 391 [2025-03-17 14:48:07,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:07,668 INFO L225 Difference]: With dead ends: 7836 [2025-03-17 14:48:07,668 INFO L226 Difference]: Without dead ends: 7835 [2025-03-17 14:48:07,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 845 GetRequests, 715 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2025-03-17 14:48:07,673 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 806 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 806 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:07,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [806 Valid, 489 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:48:07,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7835 states. [2025-03-17 14:48:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7835 to 7756. [2025-03-17 14:48:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7756 states, 7753 states have (on average 1.17064362182381) internal successors, (9076), 7755 states have internal predecessors, (9076), 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-17 14:48:07,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7756 states to 7756 states and 9076 transitions. [2025-03-17 14:48:07,795 INFO L78 Accepts]: Start accepts. Automaton has 7756 states and 9076 transitions. Word has length 391 [2025-03-17 14:48:07,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:07,796 INFO L471 AbstractCegarLoop]: Abstraction has 7756 states and 9076 transitions. [2025-03-17 14:48:07,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 131 states have (on average 5.969465648854962) internal successors, (782), 131 states have internal predecessors, (782), 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-17 14:48:07,801 INFO L276 IsEmpty]: Start isEmpty. Operand 7756 states and 9076 transitions. [2025-03-17 14:48:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-17 14:48:07,811 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:07,811 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 94, 94, 94, 1, 1] [2025-03-17 14:48:07,819 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 14:48:08,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 14:48:08,013 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:48:08,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:08,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1798351480, now seen corresponding path program 6 times [2025-03-17 14:48:08,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:08,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112280715] [2025-03-17 14:48:08,014 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 14:48:08,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:08,023 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 569 statements into 95 equivalence classes. [2025-03-17 14:48:08,087 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 94 check-sat command(s) and asserted 563 of 569 statements. [2025-03-17 14:48:08,087 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 94 check-sat command(s) [2025-03-17 14:48:08,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 26602 backedges. 21842 proven. 0 refuted. 0 times theorem prover too weak. 4760 trivial. 0 not checked. [2025-03-17 14:48:09,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:09,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112280715] [2025-03-17 14:48:09,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112280715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 14:48:09,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 14:48:09,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2025-03-17 14:48:09,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602042387] [2025-03-17 14:48:09,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 14:48:09,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-17 14:48:09,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:09,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-17 14:48:09,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 14:48:09,868 INFO L87 Difference]: Start difference. First operand 7756 states and 9076 transitions. Second operand has 57 states, 57 states have (on average 5.859649122807017) internal successors, (334), 56 states have internal predecessors, (334), 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-17 14:48:10,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:10,232 INFO L93 Difference]: Finished difference Result 8241 states and 9641 transitions. [2025-03-17 14:48:10,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-03-17 14:48:10,232 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 5.859649122807017) internal successors, (334), 56 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 569 [2025-03-17 14:48:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:10,236 INFO L225 Difference]: With dead ends: 8241 [2025-03-17 14:48:10,236 INFO L226 Difference]: Without dead ends: 788 [2025-03-17 14:48:10,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 14:48:10,241 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 25 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:10,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 709 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 14:48:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-17 14:48:10,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 788. [2025-03-17 14:48:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 787 states have (on average 1.0012706480304956) internal successors, (788), 787 states have internal predecessors, (788), 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-17 14:48:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 788 transitions. [2025-03-17 14:48:10,264 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 788 transitions. Word has length 569 [2025-03-17 14:48:10,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:10,265 INFO L471 AbstractCegarLoop]: Abstraction has 788 states and 788 transitions. [2025-03-17 14:48:10,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 5.859649122807017) internal successors, (334), 56 states have internal predecessors, (334), 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-17 14:48:10,266 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 788 transitions. [2025-03-17 14:48:10,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 788 [2025-03-17 14:48:10,277 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 14:48:10,278 INFO L218 NwaCegarLoop]: trace histogram [131, 131, 130, 80, 80, 80, 51, 51, 51, 1, 1] [2025-03-17 14:48:10,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 14:48:10,278 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 14:48:10,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 14:48:10,278 INFO L85 PathProgramCache]: Analyzing trace with hash -629794546, now seen corresponding path program 9 times [2025-03-17 14:48:10,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 14:48:10,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609467730] [2025-03-17 14:48:10,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:10,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 14:48:10,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 787 statements into 81 equivalence classes. [2025-03-17 14:48:10,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) and asserted 787 of 787 statements. [2025-03-17 14:48:10,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2025-03-17 14:48:10,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:15,672 INFO L134 CoverageAnalysis]: Checked inductivity of 42930 backedges. 29976 proven. 12752 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2025-03-17 14:48:15,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 14:48:15,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609467730] [2025-03-17 14:48:15,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609467730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 14:48:15,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833640047] [2025-03-17 14:48:15,673 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 14:48:15,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:15,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 14:48:15,675 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 14:48:15,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 14:48:15,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 787 statements into 81 equivalence classes. [2025-03-17 14:48:15,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) and asserted 787 of 787 statements. [2025-03-17 14:48:15,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 81 check-sat command(s) [2025-03-17 14:48:15,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 14:48:15,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 1314 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-17 14:48:15,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 14:48:23,959 INFO L134 CoverageAnalysis]: Checked inductivity of 42930 backedges. 0 proven. 42930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:23,960 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 14:48:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 42930 backedges. 0 proven. 42930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 14:48:39,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833640047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 14:48:39,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 14:48:39,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 131, 131] total 343 [2025-03-17 14:48:39,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877379510] [2025-03-17 14:48:39,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 14:48:39,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 344 states [2025-03-17 14:48:39,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 14:48:39,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 344 interpolants. [2025-03-17 14:48:39,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38036, Invalid=79956, Unknown=0, NotChecked=0, Total=117992 [2025-03-17 14:48:39,953 INFO L87 Difference]: Start difference. First operand 788 states and 788 transitions. Second operand has 344 states, 344 states have (on average 6.424418604651163) internal successors, (2210), 343 states have internal predecessors, (2210), 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-17 14:48:52,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 14:48:52,183 INFO L93 Difference]: Finished difference Result 788 states and 788 transitions. [2025-03-17 14:48:52,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2025-03-17 14:48:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 344 states, 344 states have (on average 6.424418604651163) internal successors, (2210), 343 states have internal predecessors, (2210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 787 [2025-03-17 14:48:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 14:48:52,185 INFO L225 Difference]: With dead ends: 788 [2025-03-17 14:48:52,185 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 14:48:52,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1911 GetRequests, 1362 SyntacticMatches, 0 SemanticMatches, 549 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50612 ImplicationChecksByTransitivity, 31.7s TimeCoverageRelationStatistics Valid=98198, Invalid=204852, Unknown=0, NotChecked=0, Total=303050 [2025-03-17 14:48:52,197 INFO L435 NwaCegarLoop]: 1 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 2745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 14:48:52,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1 Invalid, 2745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2744 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 14:48:52,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 14:48:52,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 14:48:52,198 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-17 14:48:52,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 14:48:52,199 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 787 [2025-03-17 14:48:52,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 14:48:52,199 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 14:48:52,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 344 states, 344 states have (on average 6.424418604651163) internal successors, (2210), 343 states have internal predecessors, (2210), 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-17 14:48:52,200 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 14:48:52,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 14:48:52,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 14:48:52,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 14:48:52,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 14:48:52,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 14:48:52,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 14:48:52,202 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 14:48:52,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 14:48:52,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 14:48:52,405 INFO L422 BasicCegarLoop]: Path program histogram: [9, 6, 1, 1, 1, 1, 1] [2025-03-17 14:48:52,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 14:48:53,670 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 14:48:53,704 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 02:48:53 BoogieIcfgContainer [2025-03-17 14:48:53,704 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 14:48:53,705 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 14:48:53,708 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 14:48:53,708 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 14:48:53,708 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 02:47:42" (3/4) ... [2025-03-17 14:48:53,710 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 14:48:53,718 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 14:48:53,718 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 14:48:53,718 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-17 14:48:53,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 14:48:53,776 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 14:48:53,776 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 14:48:53,777 INFO L158 Benchmark]: Toolchain (without parser) took 71534.58ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 114.6MB in the beginning and 766.2MB in the end (delta: -651.7MB). Peak memory consumption was 730.5MB. Max. memory is 16.1GB. [2025-03-17 14:48:53,777 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:48:53,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 121.97ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 104.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:48:53,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.54ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 103.7MB in the end (delta: 914.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:48:53,778 INFO L158 Benchmark]: Boogie Preprocessor took 14.02ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.8MB in the end (delta: 909.8kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 14:48:53,778 INFO L158 Benchmark]: IcfgBuilder took 183.57ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 92.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:48:53,779 INFO L158 Benchmark]: TraceAbstraction took 71121.56ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 92.3MB in the beginning and 774.6MB in the end (delta: -682.3MB). Peak memory consumption was 705.4MB. Max. memory is 16.1GB. [2025-03-17 14:48:53,779 INFO L158 Benchmark]: Witness Printer took 71.39ms. Allocated memory is still 1.5GB. Free memory was 774.6MB in the beginning and 766.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 14:48:53,780 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.29ms. Allocated memory is still 201.3MB. Free memory is still 123.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 121.97ms. Allocated memory is still 142.6MB. Free memory was 114.1MB in the beginning and 104.6MB in the end (delta: 9.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.54ms. Allocated memory is still 142.6MB. Free memory was 104.6MB in the beginning and 103.7MB in the end (delta: 914.0kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.02ms. Allocated memory is still 142.6MB. Free memory was 103.7MB in the beginning and 102.8MB in the end (delta: 909.8kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 183.57ms. Allocated memory is still 142.6MB. Free memory was 102.8MB in the beginning and 92.8MB in the end (delta: 10.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 71121.56ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 92.3MB in the beginning and 774.6MB in the end (delta: -682.3MB). Peak memory consumption was 705.4MB. Max. memory is 16.1GB. * Witness Printer took 71.39ms. Allocated memory is still 1.5GB. Free memory was 774.6MB in the beginning and 766.2MB in the end (delta: 8.4MB). 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: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: 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 1 procedures, 17 locations, 18 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 69.8s, OverallIterations: 20, TraceHistogramMax: 131, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.1s, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2094 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2094 mSDsluCounter, 3041 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2591 mSDsCounter, 811 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5743 IncrementalHoareTripleChecker+Invalid, 6554 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 811 mSolverCounterUnsat, 450 mSDtfsCounter, 5743 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5844 GetRequests, 4763 SyntacticMatches, 27 SemanticMatches, 1054 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51287 ImplicationChecksByTransitivity, 42.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7756occurred in iteration=18, InterpolantAutomatonStates: 752, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 38897 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 46.8s InterpolantComputationTime, 5832 NumberOfCodeBlocks, 5430 NumberOfCodeBlocksAsserted, 477 NumberOfCheckSat, 8398 ConstructedInterpolants, 0 QuantifiedInterpolants, 22438 SizeOfPredicates, 0 NumberOfNonLiveVariables, 4056 ConjunctsInSsa, 381 ConjunctsInUnsatCore, 48 InterpolantComputations, 6 PerfectInterpolantSequences, 82948/256132 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 6 specifications checked. All of them hold - InvariantResult [Line: 18]: Location Invariant Derived location invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((x == 50) && (y <= 50)) || (((54 <= x) && (y <= 6)) && (x <= 96))) || ((31 == x) && (y <= 31))) || (((54 <= x) && (y <= 3)) && (x <= 99))) || ((y <= 40) && (40 == x))) || (((y <= 37) && (54 <= x)) && (x <= 65))) || ((x == 11) && (y <= 11))) || ((x == 8) && (y <= 8))) || ((x == 36) && (y <= 36))) || ((x == 1) && (y <= 1))) || ((y <= 46) && (46 == x))) || ((y <= 47) && (47 == x))) || ((y <= 12) && (x == 12))) || (((54 <= x) && (x <= 83)) && (y <= 19))) || (((y <= 28) && (x <= 74)) && (54 <= x))) || ((x == 13) && (y <= 13))) || ((2 == x) && (y <= 2))) || ((y <= 29) && (29 == x))) || (((y <= 24) && (54 <= x)) && (x <= 78))) || (((y <= 40) && (54 <= x)) && (x <= 62))) || (((x <= 84) && (y <= 18)) && (54 <= x))) || ((x == 38) && (y <= 38))) || (((54 <= x) && (x <= 72)) && (y <= 30))) || (((y <= 43) && (54 <= x)) && (x <= 59))) || ((16 == x) && (y <= 16))) || ((53 == x) && (y <= 49))) || ((y <= 7) && (7 == x))) || ((y <= 39) && (x == 39))) || (((x <= 70) && (54 <= x)) && (y <= 32))) || (((54 <= x) && (x <= 82)) && (y <= 20))) || ((y <= 25) && (x == 25))) || ((5 == x) && (y <= 5))) || (((54 <= x) && (x <= 94)) && (y <= 8))) || ((x == 34) && (y <= 34))) || ((y <= 48) && (x == 48))) || (((x <= 67) && (y <= 35)) && (54 <= x))) || (((54 <= x) && (x <= 79)) && (y <= 23))) || ((22 == x) && (y <= 22))) || (((54 <= x) && (x <= 68)) && (y <= 34))) || ((y <= 15) && (x == 15))) || (((54 <= x) && (y <= 1)) && (x <= 101))) || ((y <= 6) && (6 == x))) || (((54 <= x) && (y <= 45)) && (x <= 57))) || ((y <= 28) && (x == 28))) || ((19 == x) && (y <= 19))) || (((54 <= x) && (x <= 86)) && (y <= 16))) || (((x <= 90) && (54 <= x)) && (y <= 12))) || ((y <= 4) && (x == 4))) || ((y <= 24) && (x == 24))) || (((y <= 44) && (54 <= x)) && (x <= 58))) || (((54 <= x) && (((long) y + 1) <= 0)) && (x <= 103))) || ((y <= 21) && (21 == x))) || (((54 <= x) && (x <= 64)) && (y <= 38))) || ((3 == x) && (y <= 3))) || (((x <= 63) && (54 <= x)) && (y <= 39))) || (((54 <= x) && (y <= 9)) && (x <= 93))) || ((y <= 45) && (x == 45))) || (((x <= 75) && (y <= 27)) && (54 <= x))) || (((y <= 4) && (54 <= x)) && (x <= 98))) || (((54 <= x) && (x <= 71)) && (y <= 31))) || ((y <= 42) && (42 == x))) || (((x <= 56) && (54 <= x)) && (y <= 46))) || ((y <= 17) && (x == 17))) || (((x <= 61) && (54 <= x)) && (y <= 41))) || (((y <= 15) && (54 <= x)) && (x <= 87))) || ((y <= 33) && (x == 33))) || ((y <= 20) && (x == 20))) || ((y <= 10) && (x == 10))) || (((54 <= x) && (y <= 33)) && (x <= 69))) || (((54 <= x) && (y <= 22)) && (x <= 80))) || (((54 <= x) && (y <= 0)) && (x <= 102))) || ((y <= 44) && (44 == x))) || ((y <= 27) && (x == 27))) || ((49 == x) && (y <= 49))) || (((54 <= x) && (y <= 14)) && (x <= 88))) || (((54 <= x) && (x <= 60)) && (y <= 42))) || ((y <= 43) && (x == 43))) || ((41 == x) && (y <= 41))) || ((y <= 35) && (35 == x))) || ((32 == x) && (y <= 32))) || (((54 <= x) && (x <= 85)) && (y <= 17))) || (((54 <= x) && (x <= 73)) && (y <= 29))) || ((y <= 48) && (x == 54))) || ((y <= 0) && (x == 0))) || (((y <= 47) && (54 <= x)) && (x <= 55))) || (((54 <= x) && (x <= 77)) && (y <= 25))) || (((y <= 7) && (54 <= x)) && (x <= 95))) || ((y <= 14) && (14 == x))) || ((y <= 30) && (30 == x))) || ((23 == x) && (y <= 23))) || (((y <= 26) && (x <= 76)) && (54 <= x))) || ((9 == x) && (y <= 9))) || (((54 <= x) && (y <= 21)) && (x <= 81))) || (((y <= 5) && (54 <= x)) && (x <= 97))) || (((x <= 66) && (54 <= x)) && (y <= 36))) || ((y <= 37) && (x == 37))) || (((x <= 92) && (y <= 10)) && (54 <= x))) || (((x <= 91) && (54 <= x)) && (y <= 11))) || (((x <= 89) && (54 <= x)) && (y <= 13))) || ((52 == x) && (y <= 50))) || (((y <= 2) && (54 <= x)) && (x <= 100))) || ((y <= 26) && (x == 26))) || ((y <= 18) && (x == 18))) || ((51 == x) && (y <= 51))) RESULT: Ultimate proved your program to be correct! [2025-03-17 14:48:53,796 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