./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a32548a2dc110e6882a396485f8651f4c4262f9c106b055559dda4621561bdb6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:26:26,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:26:26,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:26:26,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:26:26,489 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:26:26,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:26:26,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:26:26,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:26:26,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:26:26,505 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:26:26,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:26:26,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:26:26,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:26:26,505 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:26:26,506 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:26:26,506 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:26:26,506 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:26:26,506 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:26:26,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:26:26,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:26:26,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:26:26,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:26:26,506 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:26:26,506 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:26:26,507 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:26:26,507 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:26:26,508 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:26:26,508 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:26:26,508 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:26:26,508 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:26:26,508 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:26:26,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:26:26,508 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:26:26,508 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:26:26,508 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:26:26,508 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:26:26,508 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a32548a2dc110e6882a396485f8651f4c4262f9c106b055559dda4621561bdb6 [2025-03-09 02:26:26,764 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:26:26,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:26:26,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:26:26,776 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:26:26,777 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:26:26,778 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound20.c [2025-03-09 02:26:27,984 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001f381ba/379666aa7d6d47ed9277bb14ce90aeb6/FLAG05f409629 [2025-03-09 02:26:28,208 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:26:28,209 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound20.c [2025-03-09 02:26:28,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001f381ba/379666aa7d6d47ed9277bb14ce90aeb6/FLAG05f409629 [2025-03-09 02:26:28,225 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001f381ba/379666aa7d6d47ed9277bb14ce90aeb6 [2025-03-09 02:26:28,227 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:26:28,228 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:26:28,229 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:26:28,229 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:26:28,232 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:26:28,232 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,233 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58044d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28, skipping insertion in model container [2025-03-09 02:26:28,233 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:26:28,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:26:28,347 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:26:28,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:26:28,368 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:26:28,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28 WrapperNode [2025-03-09 02:26:28,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:26:28,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:26:28,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:26:28,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:26:28,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,378 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,390 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-03-09 02:26:28,390 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:26:28,390 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:26:28,390 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:26:28,391 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:26:28,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,398 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,406 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-09 02:26:28,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,409 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,409 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,410 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:26:28,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:26:28,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:26:28,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:26:28,413 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (1/1) ... [2025-03-09 02:26:28,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:26:28,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:28,440 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 02:26:28,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 02:26:28,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:26:28,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 02:26:28,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 02:26:28,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:26:28,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 02:26:28,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:26:28,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:26:28,459 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:26:28,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:26:28,503 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:26:28,504 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:26:28,641 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-09 02:26:28,642 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:26:28,649 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:26:28,650 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:26:28,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:26:28 BoogieIcfgContainer [2025-03-09 02:26:28,650 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:26:28,651 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:26:28,652 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:26:28,656 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:26:28,656 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:26:28" (1/3) ... [2025-03-09 02:26:28,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d02adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:26:28, skipping insertion in model container [2025-03-09 02:26:28,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:26:28" (2/3) ... [2025-03-09 02:26:28,657 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d02adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:26:28, skipping insertion in model container [2025-03-09 02:26:28,657 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:26:28" (3/3) ... [2025-03-09 02:26:28,658 INFO L128 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound20.c [2025-03-09 02:26:28,671 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:26:28,673 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lcm1_unwindbound20.c that has 3 procedures, 47 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-09 02:26:28,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:26:28,726 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;@576d27b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:26:28,726 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 02:26:28,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:26:28,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:26:28,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:28,734 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:28,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:28,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:28,741 INFO L85 PathProgramCache]: Analyzing trace with hash -867382927, now seen corresponding path program 1 times [2025-03-09 02:26:28,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:28,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448508584] [2025-03-09 02:26:28,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:28,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:28,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:26:28,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:26:28,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:28,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:26:28,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:28,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448508584] [2025-03-09 02:26:28,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448508584] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:28,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994366768] [2025-03-09 02:26:28,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:28,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:28,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:28,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:26:28,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 02:26:28,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:26:28,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:26:28,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:28,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:28,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 02:26:28,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-09 02:26:28,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:26:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994366768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:28,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:26:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-09 02:26:28,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832535651] [2025-03-09 02:26:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:28,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:26:28,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:28,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:26:28,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:26:28,967 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:26:28,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:28,981 INFO L93 Difference]: Finished difference Result 90 states and 132 transitions. [2025-03-09 02:26:28,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:26:28,982 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-09 02:26:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:28,986 INFO L225 Difference]: With dead ends: 90 [2025-03-09 02:26:28,986 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 02:26:28,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:26:28,990 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:28,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 02:26:29,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-09 02:26:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:26:29,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-09 02:26:29,022 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 25 [2025-03-09 02:26:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:29,022 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-09 02:26:29,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 02:26:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-09 02:26:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 02:26:29,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:29,023 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:29,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 02:26:29,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-09 02:26:29,224 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:29,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:29,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1360078897, now seen corresponding path program 1 times [2025-03-09 02:26:29,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:29,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432862464] [2025-03-09 02:26:29,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:29,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 02:26:29,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 02:26:29,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:29,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:29,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:29,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432862464] [2025-03-09 02:26:29,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432862464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:29,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:29,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:26:29,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435017494] [2025-03-09 02:26:29,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:29,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:26:29,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:29,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:26:29,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:29,379 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:26:29,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:29,432 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-09 02:26:29,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:26:29,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2025-03-09 02:26:29,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:29,433 INFO L225 Difference]: With dead ends: 45 [2025-03-09 02:26:29,433 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 02:26:29,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:26:29,434 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:29,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:29,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 02:26:29,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-03-09 02:26:29,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:26:29,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-09 02:26:29,441 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 25 [2025-03-09 02:26:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:29,442 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-09 02:26:29,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-09 02:26:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-09 02:26:29,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-09 02:26:29,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:29,447 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:29,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 02:26:29,447 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:29,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:29,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1700255200, now seen corresponding path program 1 times [2025-03-09 02:26:29,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:29,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597794722] [2025-03-09 02:26:29,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:29,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:29,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 02:26:29,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 02:26:29,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:29,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:29,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:29,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597794722] [2025-03-09 02:26:29,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597794722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:29,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:29,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:26:29,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000214937] [2025-03-09 02:26:29,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:29,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:26:29,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:29,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:26:29,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:26:29,630 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:26:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:29,782 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-03-09 02:26:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:26:29,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2025-03-09 02:26:29,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:29,784 INFO L225 Difference]: With dead ends: 62 [2025-03-09 02:26:29,784 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 02:26:29,784 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:26:29,784 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:29,785 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 177 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:29,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 02:26:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-09 02:26:29,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 42 states have internal predecessors, (50), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:26:29,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-09 02:26:29,791 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 35 [2025-03-09 02:26:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:29,791 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-09 02:26:29,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:26:29,792 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-09 02:26:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-09 02:26:29,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:29,792 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:29,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:26:29,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:29,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:29,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1168303653, now seen corresponding path program 1 times [2025-03-09 02:26:29,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:29,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245422561] [2025-03-09 02:26:29,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:29,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:29,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-09 02:26:29,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-09 02:26:29,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:29,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:29,904 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:29,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:29,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245422561] [2025-03-09 02:26:29,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245422561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:29,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:29,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 02:26:29,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297401388] [2025-03-09 02:26:29,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:29,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:26:29,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:29,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:26:29,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:26:29,906 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:26:29,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:29,963 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2025-03-09 02:26:29,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 02:26:29,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2025-03-09 02:26:29,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:29,965 INFO L225 Difference]: With dead ends: 91 [2025-03-09 02:26:29,965 INFO L226 Difference]: Without dead ends: 63 [2025-03-09 02:26:29,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:26:29,966 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:29,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-09 02:26:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-09 02:26:29,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:26:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-09 02:26:29,977 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 36 [2025-03-09 02:26:29,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:29,978 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-09 02:26:29,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 02:26:29,978 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-09 02:26:29,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 02:26:29,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:29,979 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:29,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:26:29,979 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:29,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:29,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1272493830, now seen corresponding path program 1 times [2025-03-09 02:26:29,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:29,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125995356] [2025-03-09 02:26:29,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:29,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:29,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 02:26:29,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 02:26:29,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:29,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:26:30,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:30,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125995356] [2025-03-09 02:26:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125995356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:30,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:30,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:26:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371242805] [2025-03-09 02:26:30,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:30,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:26:30,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:30,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:26:30,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:26:30,140 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:26:30,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:30,319 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-03-09 02:26:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:26:30,321 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2025-03-09 02:26:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:30,322 INFO L225 Difference]: With dead ends: 81 [2025-03-09 02:26:30,322 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 02:26:30,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:26:30,323 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:30,324 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 232 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 02:26:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-03-09 02:26:30,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 57 states have internal predecessors, (68), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:26:30,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2025-03-09 02:26:30,344 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 45 [2025-03-09 02:26:30,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:30,345 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2025-03-09 02:26:30,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:26:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2025-03-09 02:26:30,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:26:30,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:30,346 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:30,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:26:30,346 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-09 02:26:30,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:30,347 INFO L85 PathProgramCache]: Analyzing trace with hash 792603048, now seen corresponding path program 1 times [2025-03-09 02:26:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:30,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470538570] [2025-03-09 02:26:30,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:30,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:30,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:26:30,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:26:30,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:30,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:30,480 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:26:30,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:30,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470538570] [2025-03-09 02:26:30,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470538570] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:30,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:30,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 02:26:30,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318956663] [2025-03-09 02:26:30,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:30,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:26:30,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:30,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:26:30,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-09 02:26:30,483 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:26:30,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:30,613 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-03-09 02:26:30,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 02:26:30,615 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2025-03-09 02:26:30,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:30,616 INFO L225 Difference]: With dead ends: 115 [2025-03-09 02:26:30,616 INFO L226 Difference]: Without dead ends: 87 [2025-03-09 02:26:30,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-09 02:26:30,617 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:30,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:30,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-09 02:26:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-09 02:26:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 65 states have internal predecessors, (77), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-09 02:26:30,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2025-03-09 02:26:30,629 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 46 [2025-03-09 02:26:30,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:30,630 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-03-09 02:26:30,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-09 02:26:30,631 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2025-03-09 02:26:30,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-09 02:26:30,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:30,631 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:30,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:26:30,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:30,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:30,632 INFO L85 PathProgramCache]: Analyzing trace with hash 792675539, now seen corresponding path program 1 times [2025-03-09 02:26:30,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:30,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271145396] [2025-03-09 02:26:30,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:30,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:30,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:26:30,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:26:30,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:30,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:26:30,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:30,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271145396] [2025-03-09 02:26:30,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271145396] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:30,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1467838376] [2025-03-09 02:26:30,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:30,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:30,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:30,766 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:26:30,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 02:26:30,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-09 02:26:30,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-09 02:26:30,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:30,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:30,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:26:30,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:30,896 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:30,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:31,025 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:26:31,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1467838376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:31,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:31,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-09 02:26:31,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240897291] [2025-03-09 02:26:31,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:31,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 02:26:31,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:31,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 02:26:31,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-09 02:26:31,027 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:26:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:31,564 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2025-03-09 02:26:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:26:31,565 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 46 [2025-03-09 02:26:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:31,566 INFO L225 Difference]: With dead ends: 233 [2025-03-09 02:26:31,566 INFO L226 Difference]: Without dead ends: 195 [2025-03-09 02:26:31,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2025-03-09 02:26:31,567 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:31,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 289 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:26:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-09 02:26:31,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2025-03-09 02:26:31,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 125 states have (on average 1.272) internal successors, (159), 130 states have internal predecessors, (159), 18 states have call successors, (18), 14 states have call predecessors, (18), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-09 02:26:31,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 195 transitions. [2025-03-09 02:26:31,579 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 195 transitions. Word has length 46 [2025-03-09 02:26:31,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:31,579 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 195 transitions. [2025-03-09 02:26:31,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-09 02:26:31,579 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2025-03-09 02:26:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 02:26:31,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:31,583 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:31,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:31,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-09 02:26:31,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:31,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:31,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1498090115, now seen corresponding path program 1 times [2025-03-09 02:26:31,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:31,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611059959] [2025-03-09 02:26:31,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:31,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:31,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 02:26:31,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 02:26:31,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:31,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:31,855 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:31,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611059959] [2025-03-09 02:26:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611059959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:31,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:26:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440985075] [2025-03-09 02:26:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:31,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:26:31,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:31,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:26:31,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:31,856 INFO L87 Difference]: Start difference. First operand 163 states and 195 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 02:26:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:31,900 INFO L93 Difference]: Finished difference Result 270 states and 329 transitions. [2025-03-09 02:26:31,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:26:31,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 55 [2025-03-09 02:26:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:31,905 INFO L225 Difference]: With dead ends: 270 [2025-03-09 02:26:31,905 INFO L226 Difference]: Without dead ends: 205 [2025-03-09 02:26:31,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:31,906 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:31,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:31,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-09 02:26:31,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2025-03-09 02:26:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 146 states have internal predecessors, (182), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-09 02:26:31,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 226 transitions. [2025-03-09 02:26:31,919 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 226 transitions. Word has length 55 [2025-03-09 02:26:31,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:31,919 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 226 transitions. [2025-03-09 02:26:31,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-09 02:26:31,920 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 226 transitions. [2025-03-09 02:26:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-09 02:26:31,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:31,920 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:31,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 02:26:31,920 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-09 02:26:31,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:31,921 INFO L85 PathProgramCache]: Analyzing trace with hash -803810935, now seen corresponding path program 1 times [2025-03-09 02:26:31,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:31,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564582634] [2025-03-09 02:26:31,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:31,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:26:31,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:26:31,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:31,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:32,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564582634] [2025-03-09 02:26:32,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564582634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:32,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362854245] [2025-03-09 02:26:32,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:32,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:32,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:32,061 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:26:32,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 02:26:32,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-09 02:26:32,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-09 02:26:32,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:32,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:32,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:26:32,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:32,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:32,366 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:32,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362854245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:32,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:32,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-09 02:26:32,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386293547] [2025-03-09 02:26:32,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:32,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-09 02:26:32,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:32,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-09 02:26:32,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-09 02:26:32,369 INFO L87 Difference]: Start difference. First operand 183 states and 226 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-09 02:26:33,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:33,317 INFO L93 Difference]: Finished difference Result 379 states and 473 transitions. [2025-03-09 02:26:33,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-09 02:26:33,317 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Word has length 56 [2025-03-09 02:26:33,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:33,319 INFO L225 Difference]: With dead ends: 379 [2025-03-09 02:26:33,319 INFO L226 Difference]: Without dead ends: 296 [2025-03-09 02:26:33,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=507, Invalid=1943, Unknown=0, NotChecked=0, Total=2450 [2025-03-09 02:26:33,321 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 175 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:33,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 327 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:26:33,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-09 02:26:33,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2025-03-09 02:26:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 211 states have internal predecessors, (263), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-09 02:26:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 321 transitions. [2025-03-09 02:26:33,362 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 321 transitions. Word has length 56 [2025-03-09 02:26:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:33,362 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 321 transitions. [2025-03-09 02:26:33,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-09 02:26:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 321 transitions. [2025-03-09 02:26:33,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-09 02:26:33,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:33,363 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:33,372 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:33,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:33,564 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:33,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -281102517, now seen corresponding path program 1 times [2025-03-09 02:26:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:33,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832719272] [2025-03-09 02:26:33,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:33,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:26:33,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:26:33,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:33,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:33,695 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:33,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832719272] [2025-03-09 02:26:33,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832719272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:33,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021002825] [2025-03-09 02:26:33,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:33,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:33,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:33,697 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:26:33,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 02:26:33,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-09 02:26:33,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-09 02:26:33,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:33,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:33,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:26:33,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:33,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:33,946 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-09 02:26:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021002825] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:33,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:33,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2025-03-09 02:26:33,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045430296] [2025-03-09 02:26:33,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:33,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 02:26:33,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:33,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 02:26:33,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-03-09 02:26:33,951 INFO L87 Difference]: Start difference. First operand 263 states and 321 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-09 02:26:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:34,510 INFO L93 Difference]: Finished difference Result 471 states and 581 transitions. [2025-03-09 02:26:34,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 02:26:34,510 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Word has length 59 [2025-03-09 02:26:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:34,513 INFO L225 Difference]: With dead ends: 471 [2025-03-09 02:26:34,513 INFO L226 Difference]: Without dead ends: 332 [2025-03-09 02:26:34,514 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2025-03-09 02:26:34,515 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:34,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 313 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:26:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-09 02:26:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 323. [2025-03-09 02:26:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.244186046511628) internal successors, (321), 263 states have internal predecessors, (321), 33 states have call successors, (33), 26 states have call predecessors, (33), 26 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-09 02:26:34,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 387 transitions. [2025-03-09 02:26:34,536 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 387 transitions. Word has length 59 [2025-03-09 02:26:34,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:34,537 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 387 transitions. [2025-03-09 02:26:34,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-09 02:26:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 387 transitions. [2025-03-09 02:26:34,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-09 02:26:34,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:34,540 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:34,547 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 02:26:34,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:34,740 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:34,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:34,741 INFO L85 PathProgramCache]: Analyzing trace with hash -926240830, now seen corresponding path program 1 times [2025-03-09 02:26:34,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:34,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058552570] [2025-03-09 02:26:34,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:34,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:34,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:26:34,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:26:34,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:34,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:26:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:34,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058552570] [2025-03-09 02:26:34,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058552570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:34,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997903510] [2025-03-09 02:26:34,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:34,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:34,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:34,893 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-09 02:26:34,895 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-09 02:26:34,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 02:26:34,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 02:26:34,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:34,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:34,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:26:34,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:35,104 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:35,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:26:35,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997903510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:35,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:26:35,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2025-03-09 02:26:35,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954763147] [2025-03-09 02:26:35,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:35,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 02:26:35,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:35,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 02:26:35,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:26:35,105 INFO L87 Difference]: Start difference. First operand 323 states and 387 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 02:26:35,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:35,382 INFO L93 Difference]: Finished difference Result 391 states and 469 transitions. [2025-03-09 02:26:35,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 02:26:35,383 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 65 [2025-03-09 02:26:35,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:35,385 INFO L225 Difference]: With dead ends: 391 [2025-03-09 02:26:35,385 INFO L226 Difference]: Without dead ends: 388 [2025-03-09 02:26:35,386 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-09 02:26:35,386 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:35,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 141 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:26:35,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-09 02:26:35,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 293. [2025-03-09 02:26:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 234 states have (on average 1.1623931623931625) internal successors, (272), 237 states have internal predecessors, (272), 31 states have call successors, (31), 25 states have call predecessors, (31), 25 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-09 02:26:35,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 334 transitions. [2025-03-09 02:26:35,409 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 334 transitions. Word has length 65 [2025-03-09 02:26:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:35,409 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 334 transitions. [2025-03-09 02:26:35,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-09 02:26:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 334 transitions. [2025-03-09 02:26:35,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-09 02:26:35,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:35,410 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:35,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:26:35,611 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,SelfDestructingSolverStorable10 [2025-03-09 02:26:35,611 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:35,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:35,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1351305348, now seen corresponding path program 1 times [2025-03-09 02:26:35,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:35,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072669480] [2025-03-09 02:26:35,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:35,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:35,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:26:35,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:26:35,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:35,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:35,781 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:26:35,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:35,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072669480] [2025-03-09 02:26:35,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072669480] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:35,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747793798] [2025-03-09 02:26:35,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:35,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:35,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:35,785 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-09 02:26:35,786 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-09 02:26:35,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-09 02:26:35,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-09 02:26:35,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:35,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:35,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-09 02:26:35,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:35,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:36,157 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-09 02:26:36,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747793798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:36,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:36,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-03-09 02:26:36,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038608424] [2025-03-09 02:26:36,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:36,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-09 02:26:36,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:36,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 02:26:36,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-09 02:26:36,160 INFO L87 Difference]: Start difference. First operand 293 states and 334 transitions. Second operand has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-09 02:26:37,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:37,199 INFO L93 Difference]: Finished difference Result 332 states and 381 transitions. [2025-03-09 02:26:37,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 02:26:37,200 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Word has length 66 [2025-03-09 02:26:37,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:37,202 INFO L225 Difference]: With dead ends: 332 [2025-03-09 02:26:37,202 INFO L226 Difference]: Without dead ends: 331 [2025-03-09 02:26:37,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2025-03-09 02:26:37,205 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 184 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:37,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 351 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-09 02:26:37,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-09 02:26:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 306. [2025-03-09 02:26:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 245 states have (on average 1.1591836734693877) internal successors, (284), 248 states have internal predecessors, (284), 32 states have call successors, (32), 26 states have call predecessors, (32), 26 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-09 02:26:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 348 transitions. [2025-03-09 02:26:37,237 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 348 transitions. Word has length 66 [2025-03-09 02:26:37,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:37,238 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 348 transitions. [2025-03-09 02:26:37,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-09 02:26:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 348 transitions. [2025-03-09 02:26:37,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 02:26:37,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:37,240 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:37,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:26:37,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:37,441 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:37,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:37,441 INFO L85 PathProgramCache]: Analyzing trace with hash -417891471, now seen corresponding path program 1 times [2025-03-09 02:26:37,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:37,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527619946] [2025-03-09 02:26:37,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:37,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:37,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:26:37,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:26:37,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:37,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-09 02:26:37,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527619946] [2025-03-09 02:26:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527619946] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:37,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725764252] [2025-03-09 02:26:37,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:37,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:37,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:37,658 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-09 02:26:37,660 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-09 02:26:37,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 02:26:37,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 02:26:37,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:37,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:37,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:26:37,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:37,810 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:37,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-09 02:26:37,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725764252] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:37,986 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:37,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 29 [2025-03-09 02:26:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992318649] [2025-03-09 02:26:37,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:37,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-09 02:26:37,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:37,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-09 02:26:37,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2025-03-09 02:26:37,988 INFO L87 Difference]: Start difference. First operand 306 states and 348 transitions. Second operand has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 13 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) [2025-03-09 02:26:38,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:38,632 INFO L93 Difference]: Finished difference Result 542 states and 628 transitions. [2025-03-09 02:26:38,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-09 02:26:38,633 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 13 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) Word has length 80 [2025-03-09 02:26:38,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:38,635 INFO L225 Difference]: With dead ends: 542 [2025-03-09 02:26:38,635 INFO L226 Difference]: Without dead ends: 383 [2025-03-09 02:26:38,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1709, Unknown=0, NotChecked=0, Total=2352 [2025-03-09 02:26:38,636 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 173 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:38,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 375 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:26:38,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-09 02:26:38,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 360. [2025-03-09 02:26:38,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 289 states have (on average 1.1522491349480968) internal successors, (333), 292 states have internal predecessors, (333), 37 states have call successors, (37), 31 states have call predecessors, (37), 31 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-09 02:26:38,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 407 transitions. [2025-03-09 02:26:38,652 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 407 transitions. Word has length 80 [2025-03-09 02:26:38,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:38,652 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 407 transitions. [2025-03-09 02:26:38,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 13 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) [2025-03-09 02:26:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 407 transitions. [2025-03-09 02:26:38,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:26:38,653 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:38,653 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:38,660 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:38,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:38,858 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-09 02:26:38,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:38,858 INFO L85 PathProgramCache]: Analyzing trace with hash -312192998, now seen corresponding path program 1 times [2025-03-09 02:26:38,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:38,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680150561] [2025-03-09 02:26:38,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:38,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:38,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:26:38,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:26:38,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:38,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:39,079 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:26:39,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:39,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680150561] [2025-03-09 02:26:39,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680150561] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:39,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10212206] [2025-03-09 02:26:39,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:39,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:39,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:39,082 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-09 02:26:39,084 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-09 02:26:39,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:26:39,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:26:39,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:39,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:39,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:26:39,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:39,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:26:39,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10212206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:39,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:39,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-09 02:26:39,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596962245] [2025-03-09 02:26:39,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:39,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-09 02:26:39,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:39,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-09 02:26:39,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 02:26:39,600 INFO L87 Difference]: Start difference. First operand 360 states and 407 transitions. Second operand has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:26:41,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:41,227 INFO L93 Difference]: Finished difference Result 776 states and 906 transitions. [2025-03-09 02:26:41,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-09 02:26:41,227 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 86 [2025-03-09 02:26:41,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:41,230 INFO L225 Difference]: With dead ends: 776 [2025-03-09 02:26:41,230 INFO L226 Difference]: Without dead ends: 617 [2025-03-09 02:26:41,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=7350, Unknown=0, NotChecked=0, Total=9120 [2025-03-09 02:26:41,233 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 546 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:41,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 369 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:26:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-09 02:26:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 556. [2025-03-09 02:26:41,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 445 states have (on average 1.1752808988764045) internal successors, (523), 448 states have internal predecessors, (523), 57 states have call successors, (57), 51 states have call predecessors, (57), 51 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-09 02:26:41,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 637 transitions. [2025-03-09 02:26:41,263 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 637 transitions. Word has length 86 [2025-03-09 02:26:41,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:41,263 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 637 transitions. [2025-03-09 02:26:41,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:26:41,265 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 637 transitions. [2025-03-09 02:26:41,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:26:41,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:41,267 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:41,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:41,471 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,SelfDestructingSolverStorable13 [2025-03-09 02:26:41,472 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:41,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:41,473 INFO L85 PathProgramCache]: Analyzing trace with hash -381304629, now seen corresponding path program 1 times [2025-03-09 02:26:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586912105] [2025-03-09 02:26:41,473 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:41,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:26:41,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:26:41,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:41,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:26:41,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586912105] [2025-03-09 02:26:41,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586912105] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:41,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595500704] [2025-03-09 02:26:41,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:41,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:41,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:41,659 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-09 02:26:41,660 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-09 02:26:41,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-09 02:26:41,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:26:41,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:41,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:41,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-09 02:26:41,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:41,904 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:41,904 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:42,136 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:26:42,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595500704] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:42,137 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:42,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-09 02:26:42,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084106624] [2025-03-09 02:26:42,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:42,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-09 02:26:42,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:42,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-09 02:26:42,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2025-03-09 02:26:42,138 INFO L87 Difference]: Start difference. First operand 556 states and 637 transitions. Second operand has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:26:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:43,547 INFO L93 Difference]: Finished difference Result 716 states and 822 transitions. [2025-03-09 02:26:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-09 02:26:43,548 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 86 [2025-03-09 02:26:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:43,551 INFO L225 Difference]: With dead ends: 716 [2025-03-09 02:26:43,551 INFO L226 Difference]: Without dead ends: 713 [2025-03-09 02:26:43,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1656, Invalid=6716, Unknown=0, NotChecked=0, Total=8372 [2025-03-09 02:26:43,554 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 347 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:43,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 387 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:26:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-09 02:26:43,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 608. [2025-03-09 02:26:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 485 states have (on average 1.1814432989690722) internal successors, (573), 488 states have internal predecessors, (573), 63 states have call successors, (63), 57 states have call predecessors, (63), 57 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-09 02:26:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 699 transitions. [2025-03-09 02:26:43,583 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 699 transitions. Word has length 86 [2025-03-09 02:26:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:43,583 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 699 transitions. [2025-03-09 02:26:43,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-09 02:26:43,584 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 699 transitions. [2025-03-09 02:26:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 02:26:43,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:43,586 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:43,593 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-09 02:26:43,787 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,SelfDestructingSolverStorable14 [2025-03-09 02:26:43,787 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:43,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:43,788 INFO L85 PathProgramCache]: Analyzing trace with hash -707708897, now seen corresponding path program 1 times [2025-03-09 02:26:43,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:43,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939142866] [2025-03-09 02:26:43,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:43,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:43,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 02:26:43,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 02:26:43,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:43,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-09 02:26:44,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939142866] [2025-03-09 02:26:44,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939142866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:44,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693497980] [2025-03-09 02:26:44,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:44,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:44,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:44,008 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-09 02:26:44,009 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-09 02:26:44,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-09 02:26:44,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-09 02:26:44,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:44,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:44,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 02:26:44,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:44,151 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 142 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:44,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:44,388 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-09 02:26:44,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693497980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:44,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:44,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 37 [2025-03-09 02:26:44,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500614324] [2025-03-09 02:26:44,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:44,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-09 02:26:44,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:44,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-09 02:26:44,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2025-03-09 02:26:44,390 INFO L87 Difference]: Start difference. First operand 608 states and 699 transitions. Second operand has 37 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 37 states have internal predecessors, (124), 17 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2025-03-09 02:26:45,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:45,273 INFO L93 Difference]: Finished difference Result 1131 states and 1314 transitions. [2025-03-09 02:26:45,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-09 02:26:45,274 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 37 states have internal predecessors, (124), 17 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 100 [2025-03-09 02:26:45,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:45,277 INFO L225 Difference]: With dead ends: 1131 [2025-03-09 02:26:45,277 INFO L226 Difference]: Without dead ends: 842 [2025-03-09 02:26:45,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1135, Invalid=4415, Unknown=0, NotChecked=0, Total=5550 [2025-03-09 02:26:45,280 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 216 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:45,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 588 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 02:26:45,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-09 02:26:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 758. [2025-03-09 02:26:45,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 605 states have (on average 1.1586776859504133) internal successors, (701), 608 states have internal predecessors, (701), 78 states have call successors, (78), 72 states have call predecessors, (78), 72 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-09 02:26:45,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 857 transitions. [2025-03-09 02:26:45,313 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 857 transitions. Word has length 100 [2025-03-09 02:26:45,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:45,313 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 857 transitions. [2025-03-09 02:26:45,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 37 states have internal predecessors, (124), 17 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2025-03-09 02:26:45,314 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 857 transitions. [2025-03-09 02:26:45,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 02:26:45,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:45,316 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:45,323 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-09 02:26:45,516 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,SelfDestructingSolverStorable15 [2025-03-09 02:26:45,516 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:45,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:45,517 INFO L85 PathProgramCache]: Analyzing trace with hash -801127946, now seen corresponding path program 1 times [2025-03-09 02:26:45,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:45,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750872143] [2025-03-09 02:26:45,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:45,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:45,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:26:45,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:26:45,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:45,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-09 02:26:45,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750872143] [2025-03-09 02:26:45,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750872143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:45,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081784338] [2025-03-09 02:26:45,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:45,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:45,782 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-09 02:26:45,783 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-09 02:26:45,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 02:26:45,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 02:26:45,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:45,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:45,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-09 02:26:45,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 3 proven. 166 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:46,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:46,495 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-09 02:26:46,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081784338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:46,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:46,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2025-03-09 02:26:46,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466907303] [2025-03-09 02:26:46,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:46,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-09 02:26:46,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:46,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-09 02:26:46,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=2406, Unknown=0, NotChecked=0, Total=2970 [2025-03-09 02:26:46,498 INFO L87 Difference]: Start difference. First operand 758 states and 857 transitions. Second operand has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-09 02:26:48,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:48,565 INFO L93 Difference]: Finished difference Result 927 states and 1052 transitions. [2025-03-09 02:26:48,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-09 02:26:48,566 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) Word has length 106 [2025-03-09 02:26:48,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:48,569 INFO L225 Difference]: With dead ends: 927 [2025-03-09 02:26:48,569 INFO L226 Difference]: Without dead ends: 925 [2025-03-09 02:26:48,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2754, Invalid=12008, Unknown=0, NotChecked=0, Total=14762 [2025-03-09 02:26:48,573 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 515 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:48,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 416 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 02:26:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-09 02:26:48,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 624. [2025-03-09 02:26:48,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 497 states have (on average 1.1609657947686116) internal successors, (577), 501 states have internal predecessors, (577), 65 states have call successors, (65), 59 states have call predecessors, (65), 59 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-09 02:26:48,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 707 transitions. [2025-03-09 02:26:48,610 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 707 transitions. Word has length 106 [2025-03-09 02:26:48,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:48,610 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 707 transitions. [2025-03-09 02:26:48,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-09 02:26:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 707 transitions. [2025-03-09 02:26:48,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-09 02:26:48,613 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:48,613 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:48,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:48,813 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,SelfDestructingSolverStorable16 [2025-03-09 02:26:48,813 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-09 02:26:48,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:48,814 INFO L85 PathProgramCache]: Analyzing trace with hash -618230404, now seen corresponding path program 2 times [2025-03-09 02:26:48,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:48,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859219899] [2025-03-09 02:26:48,814 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:26:48,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:48,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 146 statements into 2 equivalence classes. [2025-03-09 02:26:48,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 146 of 146 statements. [2025-03-09 02:26:48,842 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:26:48,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-09 02:26:48,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:48,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859219899] [2025-03-09 02:26:48,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859219899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:48,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:48,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:26:48,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288591295] [2025-03-09 02:26:48,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:48,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:26:48,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:48,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:26:48,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:26:48,991 INFO L87 Difference]: Start difference. First operand 624 states and 707 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:26:49,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:49,103 INFO L93 Difference]: Finished difference Result 638 states and 721 transitions. [2025-03-09 02:26:49,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:26:49,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 146 [2025-03-09 02:26:49,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:49,106 INFO L225 Difference]: With dead ends: 638 [2025-03-09 02:26:49,106 INFO L226 Difference]: Without dead ends: 637 [2025-03-09 02:26:49,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:26:49,107 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:49,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:26:49,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-09 02:26:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 624. [2025-03-09 02:26:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 497 states have (on average 1.158953722334004) internal successors, (576), 501 states have internal predecessors, (576), 65 states have call successors, (65), 59 states have call predecessors, (65), 59 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-09 02:26:49,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 706 transitions. [2025-03-09 02:26:49,143 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 706 transitions. Word has length 146 [2025-03-09 02:26:49,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:49,144 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 706 transitions. [2025-03-09 02:26:49,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:26:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 706 transitions. [2025-03-09 02:26:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-09 02:26:49,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:49,146 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:49,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 02:26:49,146 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:49,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:49,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1578962185, now seen corresponding path program 2 times [2025-03-09 02:26:49,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:49,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227862144] [2025-03-09 02:26:49,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:26:49,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:49,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-09 02:26:49,175 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-09 02:26:49,176 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:26:49,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-09 02:26:49,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:49,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227862144] [2025-03-09 02:26:49,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227862144] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:49,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540133717] [2025-03-09 02:26:49,775 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:26:49,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:49,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:49,777 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-09 02:26:49,780 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-09 02:26:49,814 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-09 02:26:49,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-09 02:26:49,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:26:49,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:49,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-09 02:26:49,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:50,020 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 3 proven. 442 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:50,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:50,487 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-09 02:26:50,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540133717] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:50,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:50,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 51 [2025-03-09 02:26:50,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485397290] [2025-03-09 02:26:50,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:50,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-09 02:26:50,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:50,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-09 02:26:50,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=470, Invalid=2080, Unknown=0, NotChecked=0, Total=2550 [2025-03-09 02:26:50,490 INFO L87 Difference]: Start difference. First operand 624 states and 706 transitions. Second operand has 51 states, 51 states have (on average 3.7058823529411766) internal successors, (189), 51 states have internal predecessors, (189), 21 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 21 states have call predecessors, (48), 21 states have call successors, (48) [2025-03-09 02:26:52,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:52,117 INFO L93 Difference]: Finished difference Result 1398 states and 1614 transitions. [2025-03-09 02:26:52,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2025-03-09 02:26:52,118 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.7058823529411766) internal successors, (189), 51 states have internal predecessors, (189), 21 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 21 states have call predecessors, (48), 21 states have call successors, (48) Word has length 150 [2025-03-09 02:26:52,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:52,122 INFO L225 Difference]: With dead ends: 1398 [2025-03-09 02:26:52,123 INFO L226 Difference]: Without dead ends: 1133 [2025-03-09 02:26:52,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 272 SyntacticMatches, 6 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3121 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2287, Invalid=9055, Unknown=0, NotChecked=0, Total=11342 [2025-03-09 02:26:52,125 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 327 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 505 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:52,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 621 Invalid, 505 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:26:52,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-03-09 02:26:52,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 958. [2025-03-09 02:26:52,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 765 states have (on average 1.1464052287581699) internal successors, (877), 769 states have internal predecessors, (877), 98 states have call successors, (98), 92 states have call predecessors, (98), 92 states have return successors, (98), 96 states have call predecessors, (98), 98 states have call successors, (98) [2025-03-09 02:26:52,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1073 transitions. [2025-03-09 02:26:52,172 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1073 transitions. Word has length 150 [2025-03-09 02:26:52,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:52,172 INFO L471 AbstractCegarLoop]: Abstraction has 958 states and 1073 transitions. [2025-03-09 02:26:52,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.7058823529411766) internal successors, (189), 51 states have internal predecessors, (189), 21 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 21 states have call predecessors, (48), 21 states have call successors, (48) [2025-03-09 02:26:52,172 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1073 transitions. [2025-03-09 02:26:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-09 02:26:52,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:52,175 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 8, 8, 8, 7, 7, 7, 6, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:52,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:26:52,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:52,376 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:52,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:52,376 INFO L85 PathProgramCache]: Analyzing trace with hash -609284084, now seen corresponding path program 1 times [2025-03-09 02:26:52,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:52,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781779003] [2025-03-09 02:26:52,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:52,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:52,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-09 02:26:52,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-09 02:26:52,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:52,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:52,899 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 26 proven. 166 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-09 02:26:52,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:52,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781779003] [2025-03-09 02:26:52,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781779003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:52,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776962054] [2025-03-09 02:26:52,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:52,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:52,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:52,903 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-09 02:26:52,908 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-09 02:26:52,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-09 02:26:52,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-09 02:26:52,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:52,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:52,974 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 02:26:52,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:53,134 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 70 proven. 386 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-09 02:26:53,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:53,599 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 26 proven. 166 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2025-03-09 02:26:53,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776962054] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:53,600 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:53,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 48 [2025-03-09 02:26:53,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002125825] [2025-03-09 02:26:53,600 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:53,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-09 02:26:53,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:53,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-09 02:26:53,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=448, Invalid=1808, Unknown=0, NotChecked=0, Total=2256 [2025-03-09 02:26:53,602 INFO L87 Difference]: Start difference. First operand 958 states and 1073 transitions. Second operand has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 48 states have internal predecessors, (181), 22 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 22 states have call predecessors, (46), 22 states have call successors, (46) [2025-03-09 02:26:54,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:54,877 INFO L93 Difference]: Finished difference Result 1673 states and 1898 transitions. [2025-03-09 02:26:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-03-09 02:26:54,878 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 48 states have internal predecessors, (181), 22 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 22 states have call predecessors, (46), 22 states have call successors, (46) Word has length 154 [2025-03-09 02:26:54,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:54,882 INFO L225 Difference]: With dead ends: 1673 [2025-03-09 02:26:54,882 INFO L226 Difference]: Without dead ends: 1408 [2025-03-09 02:26:54,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 282 SyntacticMatches, 5 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2644 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1935, Invalid=7571, Unknown=0, NotChecked=0, Total=9506 [2025-03-09 02:26:54,884 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 330 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:54,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 473 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 02:26:54,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2025-03-09 02:26:54,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1316. [2025-03-09 02:26:54,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1053 states have (on average 1.1358024691358024) internal successors, (1196), 1057 states have internal predecessors, (1196), 133 states have call successors, (133), 127 states have call predecessors, (133), 127 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-09 02:26:54,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1462 transitions. [2025-03-09 02:26:54,951 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1462 transitions. Word has length 154 [2025-03-09 02:26:54,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:54,951 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1462 transitions. [2025-03-09 02:26:54,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.7708333333333335) internal successors, (181), 48 states have internal predecessors, (181), 22 states have call successors, (46), 14 states have call predecessors, (46), 14 states have return successors, (46), 22 states have call predecessors, (46), 22 states have call successors, (46) [2025-03-09 02:26:54,951 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1462 transitions. [2025-03-09 02:26:54,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-09 02:26:54,953 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:54,954 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 11, 11, 10, 10, 10, 10, 9, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:54,961 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-09 02:26:55,158 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,SelfDestructingSolverStorable19 [2025-03-09 02:26:55,158 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:55,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:55,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1882075903, now seen corresponding path program 1 times [2025-03-09 02:26:55,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:55,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662785555] [2025-03-09 02:26:55,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:55,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:55,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-09 02:26:55,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-09 02:26:55,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:55,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2025-03-09 02:26:55,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:55,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662785555] [2025-03-09 02:26:55,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662785555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:55,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:55,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:26:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186018062] [2025-03-09 02:26:55,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:55,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:26:55,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:55,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:26:55,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:55,221 INFO L87 Difference]: Start difference. First operand 1316 states and 1462 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:26:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:55,318 INFO L93 Difference]: Finished difference Result 1787 states and 2015 transitions. [2025-03-09 02:26:55,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:26:55,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 156 [2025-03-09 02:26:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:55,325 INFO L225 Difference]: With dead ends: 1787 [2025-03-09 02:26:55,325 INFO L226 Difference]: Without dead ends: 1366 [2025-03-09 02:26:55,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:26:55,327 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:55,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 150 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:55,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2025-03-09 02:26:55,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1310. [2025-03-09 02:26:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 1050 states have (on average 1.1276190476190475) internal successors, (1184), 1054 states have internal predecessors, (1184), 133 states have call successors, (133), 124 states have call predecessors, (133), 124 states have return successors, (133), 131 states have call predecessors, (133), 133 states have call successors, (133) [2025-03-09 02:26:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1450 transitions. [2025-03-09 02:26:55,384 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1450 transitions. Word has length 156 [2025-03-09 02:26:55,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:55,384 INFO L471 AbstractCegarLoop]: Abstraction has 1310 states and 1450 transitions. [2025-03-09 02:26:55,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-09 02:26:55,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1450 transitions. [2025-03-09 02:26:55,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-09 02:26:55,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:55,386 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:55,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 02:26:55,387 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:55,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:55,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2021847223, now seen corresponding path program 2 times [2025-03-09 02:26:55,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:55,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732734897] [2025-03-09 02:26:55,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:26:55,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:55,393 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 156 statements into 2 equivalence classes. [2025-03-09 02:26:55,399 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 156 of 156 statements. [2025-03-09 02:26:55,399 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:26:55,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-09 02:26:55,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:55,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732734897] [2025-03-09 02:26:55,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732734897] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:26:55,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:26:55,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:26:55,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968605193] [2025-03-09 02:26:55,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:26:55,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 02:26:55,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:55,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 02:26:55,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:26:55,485 INFO L87 Difference]: Start difference. First operand 1310 states and 1450 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:26:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:55,583 INFO L93 Difference]: Finished difference Result 1325 states and 1466 transitions. [2025-03-09 02:26:55,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:26:55,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 156 [2025-03-09 02:26:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:55,589 INFO L225 Difference]: With dead ends: 1325 [2025-03-09 02:26:55,590 INFO L226 Difference]: Without dead ends: 1321 [2025-03-09 02:26:55,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:26:55,591 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:55,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 128 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:26:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2025-03-09 02:26:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1163. [2025-03-09 02:26:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1163 states, 934 states have (on average 1.126338329764454) internal successors, (1052), 938 states have internal predecessors, (1052), 117 states have call successors, (117), 109 states have call predecessors, (117), 109 states have return successors, (117), 115 states have call predecessors, (117), 117 states have call successors, (117) [2025-03-09 02:26:55,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1163 states to 1163 states and 1286 transitions. [2025-03-09 02:26:55,654 INFO L78 Accepts]: Start accepts. Automaton has 1163 states and 1286 transitions. Word has length 156 [2025-03-09 02:26:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:55,654 INFO L471 AbstractCegarLoop]: Abstraction has 1163 states and 1286 transitions. [2025-03-09 02:26:55,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:26:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1163 states and 1286 transitions. [2025-03-09 02:26:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-09 02:26:55,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:55,657 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:55,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-09 02:26:55,657 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:55,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:55,657 INFO L85 PathProgramCache]: Analyzing trace with hash 2131658334, now seen corresponding path program 1 times [2025-03-09 02:26:55,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:55,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45976417] [2025-03-09 02:26:55,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:55,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:55,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-09 02:26:55,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-09 02:26:55,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:55,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:56,225 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-09 02:26:56,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:56,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45976417] [2025-03-09 02:26:56,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45976417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:56,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388689540] [2025-03-09 02:26:56,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:56,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:56,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:56,228 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-09 02:26:56,230 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-09 02:26:56,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-09 02:26:56,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-09 02:26:56,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:56,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:56,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-09 02:26:56,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:26:56,469 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 6 proven. 492 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:26:56,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:26:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 6 proven. 180 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-09 02:26:56,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388689540] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:26:56,973 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:26:56,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 30] total 51 [2025-03-09 02:26:56,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705605771] [2025-03-09 02:26:56,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:26:56,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-09 02:26:56,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:26:56,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-09 02:26:56,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=457, Invalid=2093, Unknown=0, NotChecked=0, Total=2550 [2025-03-09 02:26:56,975 INFO L87 Difference]: Start difference. First operand 1163 states and 1286 transitions. Second operand has 51 states, 51 states have (on average 3.803921568627451) internal successors, (194), 51 states have internal predecessors, (194), 21 states have call successors, (49), 15 states have call predecessors, (49), 15 states have return successors, (49), 21 states have call predecessors, (49), 21 states have call successors, (49) [2025-03-09 02:26:58,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:26:58,700 INFO L93 Difference]: Finished difference Result 2312 states and 2595 transitions. [2025-03-09 02:26:58,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-09 02:26:58,701 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.803921568627451) internal successors, (194), 51 states have internal predecessors, (194), 21 states have call successors, (49), 15 states have call predecessors, (49), 15 states have return successors, (49), 21 states have call predecessors, (49), 21 states have call successors, (49) Word has length 160 [2025-03-09 02:26:58,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:26:58,707 INFO L225 Difference]: With dead ends: 2312 [2025-03-09 02:26:58,707 INFO L226 Difference]: Without dead ends: 2049 [2025-03-09 02:26:58,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 290 SyntacticMatches, 10 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3337 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2077, Invalid=9053, Unknown=0, NotChecked=0, Total=11130 [2025-03-09 02:26:58,710 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 335 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-09 02:26:58,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 531 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-09 02:26:58,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2025-03-09 02:26:58,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 1238. [2025-03-09 02:26:58,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1238 states, 995 states have (on average 1.1256281407035176) internal successors, (1120), 998 states have internal predecessors, (1120), 124 states have call successors, (124), 116 states have call predecessors, (124), 116 states have return successors, (124), 123 states have call predecessors, (124), 124 states have call successors, (124) [2025-03-09 02:26:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1238 states to 1238 states and 1368 transitions. [2025-03-09 02:26:58,804 INFO L78 Accepts]: Start accepts. Automaton has 1238 states and 1368 transitions. Word has length 160 [2025-03-09 02:26:58,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:26:58,805 INFO L471 AbstractCegarLoop]: Abstraction has 1238 states and 1368 transitions. [2025-03-09 02:26:58,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.803921568627451) internal successors, (194), 51 states have internal predecessors, (194), 21 states have call successors, (49), 15 states have call predecessors, (49), 15 states have return successors, (49), 21 states have call predecessors, (49), 21 states have call successors, (49) [2025-03-09 02:26:58,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1238 states and 1368 transitions. [2025-03-09 02:26:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-09 02:26:58,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:26:58,807 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 10, 10, 10, 10, 10, 10, 8, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:26:58,814 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-09 02:26:59,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:59,008 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:26:59,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:26:59,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1911095177, now seen corresponding path program 1 times [2025-03-09 02:26:59,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:26:59,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720859815] [2025-03-09 02:26:59,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:59,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:26:59,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-09 02:26:59,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-09 02:26:59,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:59,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:59,482 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-09 02:26:59,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:26:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720859815] [2025-03-09 02:26:59,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720859815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:26:59,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667186899] [2025-03-09 02:26:59,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:26:59,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:26:59,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:26:59,485 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:26:59,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-09 02:26:59,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-09 02:26:59,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-09 02:26:59,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:26:59,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:26:59,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 02:26:59,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 3 proven. 649 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:27:00,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:01,149 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 3 proven. 285 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-09 02:27:01,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667186899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:01,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:01,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 30, 30] total 90 [2025-03-09 02:27:01,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928794289] [2025-03-09 02:27:01,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:01,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2025-03-09 02:27:01,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:01,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2025-03-09 02:27:01,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1638, Invalid=6552, Unknown=0, NotChecked=0, Total=8190 [2025-03-09 02:27:01,155 INFO L87 Difference]: Start difference. First operand 1238 states and 1368 transitions. Second operand has 91 states, 90 states have (on average 3.011111111111111) internal successors, (271), 91 states have internal predecessors, (271), 44 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 44 states have call predecessors, (50), 44 states have call successors, (50) [2025-03-09 02:27:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:05,489 INFO L93 Difference]: Finished difference Result 2453 states and 2798 transitions. [2025-03-09 02:27:05,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2025-03-09 02:27:05,490 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 90 states have (on average 3.011111111111111) internal successors, (271), 91 states have internal predecessors, (271), 44 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 44 states have call predecessors, (50), 44 states have call successors, (50) Word has length 166 [2025-03-09 02:27:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:05,504 INFO L225 Difference]: With dead ends: 2453 [2025-03-09 02:27:05,504 INFO L226 Difference]: Without dead ends: 2190 [2025-03-09 02:27:05,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 481 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11291 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=8721, Invalid=35169, Unknown=0, NotChecked=0, Total=43890 [2025-03-09 02:27:05,506 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 851 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:05,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 545 Invalid, 886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-09 02:27:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2190 states. [2025-03-09 02:27:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2190 to 1434. [2025-03-09 02:27:05,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1434 states, 1151 states have (on average 1.1364031277150304) internal successors, (1308), 1154 states have internal predecessors, (1308), 145 states have call successors, (145), 135 states have call predecessors, (145), 135 states have return successors, (145), 144 states have call predecessors, (145), 145 states have call successors, (145) [2025-03-09 02:27:05,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1434 states to 1434 states and 1598 transitions. [2025-03-09 02:27:05,580 INFO L78 Accepts]: Start accepts. Automaton has 1434 states and 1598 transitions. Word has length 166 [2025-03-09 02:27:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:05,580 INFO L471 AbstractCegarLoop]: Abstraction has 1434 states and 1598 transitions. [2025-03-09 02:27:05,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 90 states have (on average 3.011111111111111) internal successors, (271), 91 states have internal predecessors, (271), 44 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 44 states have call predecessors, (50), 44 states have call successors, (50) [2025-03-09 02:27:05,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1434 states and 1598 transitions. [2025-03-09 02:27:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-09 02:27:05,585 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:05,586 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:05,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-09 02:27:05,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:05,787 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:27:05,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:05,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1176328544, now seen corresponding path program 2 times [2025-03-09 02:27:05,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:05,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860308674] [2025-03-09 02:27:05,787 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:05,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:05,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-09 02:27:05,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-09 02:27:05,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:05,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 90 proven. 104 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-09 02:27:06,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:06,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860308674] [2025-03-09 02:27:06,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860308674] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:06,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911908398] [2025-03-09 02:27:06,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:06,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:06,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:06,185 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:27:06,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-09 02:27:06,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 174 statements into 2 equivalence classes. [2025-03-09 02:27:06,249 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 174 of 174 statements. [2025-03-09 02:27:06,250 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:06,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:06,251 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-09 02:27:06,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:06,369 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 250 proven. 284 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-09 02:27:06,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:06,775 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 90 proven. 104 refuted. 0 times theorem prover too weak. 440 trivial. 0 not checked. [2025-03-09 02:27:06,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911908398] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:06,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:06,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 24] total 46 [2025-03-09 02:27:06,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540062552] [2025-03-09 02:27:06,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:06,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-09 02:27:06,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:06,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-09 02:27:06,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1667, Unknown=0, NotChecked=0, Total=2070 [2025-03-09 02:27:06,777 INFO L87 Difference]: Start difference. First operand 1434 states and 1598 transitions. Second operand has 46 states, 46 states have (on average 3.6956521739130435) internal successors, (170), 46 states have internal predecessors, (170), 22 states have call successors, (44), 13 states have call predecessors, (44), 13 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-09 02:27:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:08,219 INFO L93 Difference]: Finished difference Result 2369 states and 2666 transitions. [2025-03-09 02:27:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-09 02:27:08,219 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 3.6956521739130435) internal successors, (170), 46 states have internal predecessors, (170), 22 states have call successors, (44), 13 states have call predecessors, (44), 13 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) Word has length 174 [2025-03-09 02:27:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:08,225 INFO L225 Difference]: With dead ends: 2369 [2025-03-09 02:27:08,225 INFO L226 Difference]: Without dead ends: 1956 [2025-03-09 02:27:08,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 324 SyntacticMatches, 3 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2447 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1677, Invalid=7253, Unknown=0, NotChecked=0, Total=8930 [2025-03-09 02:27:08,227 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 252 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:08,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 534 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 02:27:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2025-03-09 02:27:08,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1842. [2025-03-09 02:27:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1479 states have (on average 1.1271129141311698) internal successors, (1667), 1482 states have internal predecessors, (1667), 185 states have call successors, (185), 175 states have call predecessors, (185), 175 states have return successors, (185), 184 states have call predecessors, (185), 185 states have call successors, (185) [2025-03-09 02:27:08,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2037 transitions. [2025-03-09 02:27:08,354 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2037 transitions. Word has length 174 [2025-03-09 02:27:08,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:08,355 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2037 transitions. [2025-03-09 02:27:08,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 3.6956521739130435) internal successors, (170), 46 states have internal predecessors, (170), 22 states have call successors, (44), 13 states have call predecessors, (44), 13 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-09 02:27:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2037 transitions. [2025-03-09 02:27:08,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-09 02:27:08,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:08,358 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 12, 12, 12, 11, 11, 11, 10, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:08,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-09 02:27:08,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 02:27:08,559 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:27:08,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:08,559 INFO L85 PathProgramCache]: Analyzing trace with hash 2047224091, now seen corresponding path program 1 times [2025-03-09 02:27:08,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:08,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107768242] [2025-03-09 02:27:08,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:27:08,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:08,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-09 02:27:08,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-09 02:27:08,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:27:08,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:08,620 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-03-09 02:27:08,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:08,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107768242] [2025-03-09 02:27:08,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107768242] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:08,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:27:08,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 02:27:08,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025664761] [2025-03-09 02:27:08,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:08,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:27:08,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:08,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:27:08,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:27:08,622 INFO L87 Difference]: Start difference. First operand 1842 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-09 02:27:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:08,725 INFO L93 Difference]: Finished difference Result 2698 states and 3017 transitions. [2025-03-09 02:27:08,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:27:08,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 180 [2025-03-09 02:27:08,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:08,731 INFO L225 Difference]: With dead ends: 2698 [2025-03-09 02:27:08,731 INFO L226 Difference]: Without dead ends: 1831 [2025-03-09 02:27:08,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:27:08,734 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:08,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 115 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:27:08,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1831 states. [2025-03-09 02:27:08,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1831 to 1825. [2025-03-09 02:27:08,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1825 states, 1466 states have (on average 1.1234652114597545) internal successors, (1647), 1470 states have internal predecessors, (1647), 185 states have call successors, (185), 171 states have call predecessors, (185), 171 states have return successors, (185), 183 states have call predecessors, (185), 185 states have call successors, (185) [2025-03-09 02:27:08,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1825 states to 1825 states and 2017 transitions. [2025-03-09 02:27:08,842 INFO L78 Accepts]: Start accepts. Automaton has 1825 states and 2017 transitions. Word has length 180 [2025-03-09 02:27:08,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:08,842 INFO L471 AbstractCegarLoop]: Abstraction has 1825 states and 2017 transitions. [2025-03-09 02:27:08,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-09 02:27:08,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1825 states and 2017 transitions. [2025-03-09 02:27:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-09 02:27:08,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:08,868 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 9, 9, 9, 8, 8, 8, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:08,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 02:27:08,868 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:27:08,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:08,869 INFO L85 PathProgramCache]: Analyzing trace with hash -951453600, now seen corresponding path program 2 times [2025-03-09 02:27:08,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:08,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876981134] [2025-03-09 02:27:08,869 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:08,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:08,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-09 02:27:08,890 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-09 02:27:08,890 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:08,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:09,459 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 6 proven. 266 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-09 02:27:09,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:09,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876981134] [2025-03-09 02:27:09,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876981134] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:09,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688446964] [2025-03-09 02:27:09,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:27:09,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:09,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:09,462 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:27:09,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-09 02:27:09,500 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 180 statements into 2 equivalence classes. [2025-03-09 02:27:09,544 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 180 of 180 statements. [2025-03-09 02:27:09,544 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:27:09,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:09,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 02:27:09,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 6 proven. 686 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:27:09,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:10,217 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 6 proven. 266 refuted. 0 times theorem prover too weak. 444 trivial. 0 not checked. [2025-03-09 02:27:10,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688446964] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:10,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:10,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33, 34] total 55 [2025-03-09 02:27:10,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623947409] [2025-03-09 02:27:10,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:10,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-09 02:27:10,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:10,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-09 02:27:10,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2454, Unknown=0, NotChecked=0, Total=2970 [2025-03-09 02:27:10,219 INFO L87 Difference]: Start difference. First operand 1825 states and 2017 transitions. Second operand has 55 states, 55 states have (on average 4.0181818181818185) internal successors, (221), 55 states have internal predecessors, (221), 21 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 21 states have call predecessors, (56), 21 states have call successors, (56) [2025-03-09 02:27:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:12,210 INFO L93 Difference]: Finished difference Result 3641 states and 4054 transitions. [2025-03-09 02:27:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2025-03-09 02:27:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 4.0181818181818185) internal successors, (221), 55 states have internal predecessors, (221), 21 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 21 states have call predecessors, (56), 21 states have call successors, (56) Word has length 180 [2025-03-09 02:27:12,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:12,219 INFO L225 Difference]: With dead ends: 3641 [2025-03-09 02:27:12,219 INFO L226 Difference]: Without dead ends: 3205 [2025-03-09 02:27:12,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 326 SyntacticMatches, 14 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4332 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2528, Invalid=11278, Unknown=0, NotChecked=0, Total=13806 [2025-03-09 02:27:12,222 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 349 mSDsluCounter, 611 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:12,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 644 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-09 02:27:12,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2025-03-09 02:27:12,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 1945. [2025-03-09 02:27:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1945 states, 1562 states have (on average 1.1216389244558258) internal successors, (1752), 1566 states have internal predecessors, (1752), 197 states have call successors, (197), 183 states have call predecessors, (197), 183 states have return successors, (197), 195 states have call predecessors, (197), 197 states have call successors, (197) [2025-03-09 02:27:12,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1945 states to 1945 states and 2146 transitions. [2025-03-09 02:27:12,363 INFO L78 Accepts]: Start accepts. Automaton has 1945 states and 2146 transitions. Word has length 180 [2025-03-09 02:27:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 1945 states and 2146 transitions. [2025-03-09 02:27:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 4.0181818181818185) internal successors, (221), 55 states have internal predecessors, (221), 21 states have call successors, (56), 17 states have call predecessors, (56), 17 states have return successors, (56), 21 states have call predecessors, (56), 21 states have call successors, (56) [2025-03-09 02:27:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1945 states and 2146 transitions. [2025-03-09 02:27:12,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-09 02:27:12,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:12,367 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:12,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-09 02:27:12,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-09 02:27:12,567 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:27:12,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1639448462, now seen corresponding path program 3 times [2025-03-09 02:27:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466917462] [2025-03-09 02:27:12,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:27:12,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:12,576 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 180 statements into 10 equivalence classes. [2025-03-09 02:27:12,585 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 180 statements. [2025-03-09 02:27:12,585 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 02:27:12,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:12,638 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 651 trivial. 0 not checked. [2025-03-09 02:27:12,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:12,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466917462] [2025-03-09 02:27:12,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466917462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:27:12,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:27:12,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 02:27:12,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575505344] [2025-03-09 02:27:12,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:27:12,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:27:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:12,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:27:12,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:27:12,640 INFO L87 Difference]: Start difference. First operand 1945 states and 2146 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:27:12,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:12,805 INFO L93 Difference]: Finished difference Result 1950 states and 2150 transitions. [2025-03-09 02:27:12,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:27:12,806 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 180 [2025-03-09 02:27:12,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:12,811 INFO L225 Difference]: With dead ends: 1950 [2025-03-09 02:27:12,812 INFO L226 Difference]: Without dead ends: 1949 [2025-03-09 02:27:12,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:27:12,812 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:12,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 161 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:27:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2025-03-09 02:27:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1657. [2025-03-09 02:27:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1329 states have (on average 1.1151241534988714) internal successors, (1482), 1336 states have internal predecessors, (1482), 168 states have call successors, (168), 157 states have call predecessors, (168), 157 states have return successors, (168), 163 states have call predecessors, (168), 168 states have call successors, (168) [2025-03-09 02:27:12,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 1818 transitions. [2025-03-09 02:27:12,935 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 1818 transitions. Word has length 180 [2025-03-09 02:27:12,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:12,935 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 1818 transitions. [2025-03-09 02:27:12,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-09 02:27:12,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 1818 transitions. [2025-03-09 02:27:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2025-03-09 02:27:12,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:27:12,939 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 13, 13, 12, 12, 12, 11, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:12,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-09 02:27:12,939 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 02:27:12,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:27:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash -593681116, now seen corresponding path program 3 times [2025-03-09 02:27:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:27:12,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703293157] [2025-03-09 02:27:12,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:27:12,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:27:12,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 204 statements into 13 equivalence classes. [2025-03-09 02:27:12,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 59 of 204 statements. [2025-03-09 02:27:12,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 02:27:12,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:13,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 98 proven. 1 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2025-03-09 02:27:13,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:27:13,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703293157] [2025-03-09 02:27:13,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703293157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:27:13,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057548999] [2025-03-09 02:27:13,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:27:13,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:27:13,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:27:13,043 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:27:13,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-09 02:27:13,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 204 statements into 13 equivalence classes. [2025-03-09 02:27:13,090 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 59 of 204 statements. [2025-03-09 02:27:13,090 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 02:27:13,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:27:13,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:27:13,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:27:13,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 162 proven. 1 refuted. 0 times theorem prover too weak. 891 trivial. 0 not checked. [2025-03-09 02:27:13,123 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:27:13,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 98 proven. 1 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2025-03-09 02:27:13,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057548999] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:27:13,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:27:13,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-03-09 02:27:13,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917453604] [2025-03-09 02:27:13,228 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:27:13,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-09 02:27:13,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:27:13,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-09 02:27:13,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-09 02:27:13,229 INFO L87 Difference]: Start difference. First operand 1657 states and 1818 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-09 02:27:13,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:27:13,755 INFO L93 Difference]: Finished difference Result 1765 states and 1944 transitions. [2025-03-09 02:27:13,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 02:27:13,756 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 204 [2025-03-09 02:27:13,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:27:13,757 INFO L225 Difference]: With dead ends: 1765 [2025-03-09 02:27:13,757 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:27:13,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 427 GetRequests, 399 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:27:13,760 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 78 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 02:27:13,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 289 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 02:27:13,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:27:13,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:27:13,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:27:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:27:13,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 204 [2025-03-09 02:27:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:27:13,761 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:27:13,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-09 02:27:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:27:13,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:27:13,763 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-09 02:27:13,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-09 02:27:13,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-09 02:27:13,764 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-09 02:27:13,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-09 02:27:13,765 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-09 02:27:13,771 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-09 02:27:13,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-09 02:27:13,971 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:27:13,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.