./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a22440a8f255aec9d5730865f842f7cbb927d7105e4870e8c7e734895eef852b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:21:00,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:21:00,707 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-30 10:21:00,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:21:00,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:21:00,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:21:00,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:21:00,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:21:00,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:21:00,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:21:00,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:21:00,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:21:00,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:21:00,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:21:00,729 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:21:00,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:21:00,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:21:00,729 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:21:00,730 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:21:00,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:21:00,730 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:21:00,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:21:00,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:21:00,731 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 -> a22440a8f255aec9d5730865f842f7cbb927d7105e4870e8c7e734895eef852b [2025-04-30 10:21:00,959 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:21:00,966 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:21:00,968 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:21:00,970 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:21:00,970 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:21:00,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i [2025-04-30 10:21:02,229 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cdf57bf8/652f94a2287d471e806f4d4f84f82379/FLAGee0db346d [2025-04-30 10:21:02,438 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:21:02,439 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark17_conjunctive.i [2025-04-30 10:21:02,444 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cdf57bf8/652f94a2287d471e806f4d4f84f82379/FLAGee0db346d [2025-04-30 10:21:03,229 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cdf57bf8/652f94a2287d471e806f4d4f84f82379 [2025-04-30 10:21:03,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:21:03,232 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:21:03,233 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:21:03,233 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:21:03,238 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:21:03,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a369632 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03, skipping insertion in model container [2025-04-30 10:21:03,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:21:03,395 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:21:03,403 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:21:03,423 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:21:03,433 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:21:03,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03 WrapperNode [2025-04-30 10:21:03,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:21:03,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:21:03,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:21:03,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:21:03,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,446 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,461 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 42 [2025-04-30 10:21:03,462 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:21:03,462 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:21:03,463 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:21:03,463 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:21:03,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,469 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,480 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-30 10:21:03,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,482 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,484 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,485 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,485 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,491 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:21:03,491 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:21:03,491 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:21:03,491 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:21:03,492 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (1/1) ... [2025-04-30 10:21:03,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:21:03,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:21:03,516 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-04-30 10:21:03,517 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-04-30 10:21:03,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:21:03,533 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:21:03,533 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:21:03,533 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:21:03,572 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:21:03,573 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:21:03,641 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-04-30 10:21:03,641 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:21:03,646 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:21:03,646 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:21:03,647 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:21:03 BoogieIcfgContainer [2025-04-30 10:21:03,647 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:21:03,648 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:21:03,648 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:21:03,651 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:21:03,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:21:03" (1/3) ... [2025-04-30 10:21:03,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7989a90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:21:03, skipping insertion in model container [2025-04-30 10:21:03,651 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:03" (2/3) ... [2025-04-30 10:21:03,651 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7989a90f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:21:03, skipping insertion in model container [2025-04-30 10:21:03,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:21:03" (3/3) ... [2025-04-30 10:21:03,652 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark17_conjunctive.i [2025-04-30 10:21:03,661 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:21:03,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark17_conjunctive.i that has 1 procedures, 19 locations, 22 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-30 10:21:03,697 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:21:03,706 INFO L340 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;@7ac4a16a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:21:03,706 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-30 10:21:03,709 INFO L278 IsEmpty]: Start isEmpty. Operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:03,712 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-04-30 10:21:03,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:03,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-04-30 10:21:03,713 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:03,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:03,718 INFO L85 PathProgramCache]: Analyzing trace with hash 28695813, now seen corresponding path program 1 times [2025-04-30 10:21:03,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:03,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237022821] [2025-04-30 10:21:03,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:21:03,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:03,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-30 10:21:03,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-30 10:21:03,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:21:03,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:03,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:03,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:03,845 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237022821] [2025-04-30 10:21:03,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237022821] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:21:03,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:21:03,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:21:03,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298448127] [2025-04-30 10:21:03,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:21:03,849 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:21:03,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:03,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:21:03,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:21:03,862 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:03,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:03,894 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2025-04-30 10:21:03,895 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:21:03,895 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-04-30 10:21:03,896 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:03,901 INFO L225 Difference]: With dead ends: 23 [2025-04-30 10:21:03,901 INFO L226 Difference]: Without dead ends: 11 [2025-04-30 10:21:03,903 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:21:03,906 INFO L437 NwaCegarLoop]: 13 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:03,906 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 29 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:21:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2025-04-30 10:21:03,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2025-04-30 10:21:03,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 8 states have (on average 1.375) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2025-04-30 10:21:03,925 INFO L79 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 5 [2025-04-30 10:21:03,926 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:03,926 INFO L485 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2025-04-30 10:21:03,926 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:03,926 INFO L278 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2025-04-30 10:21:03,926 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-04-30 10:21:03,926 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:03,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-30 10:21:03,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:21:03,926 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:03,928 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash 889570248, now seen corresponding path program 1 times [2025-04-30 10:21:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:03,929 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180177616] [2025-04-30 10:21:03,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:21:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:03,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-30 10:21:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-30 10:21:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:21:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:03,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:03,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180177616] [2025-04-30 10:21:03,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180177616] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:21:03,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:21:03,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:21:03,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471378844] [2025-04-30 10:21:03,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:21:03,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:21:03,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:03,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:21:03,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:21:03,974 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:03,987 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2025-04-30 10:21:03,987 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:21:03,987 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-04-30 10:21:03,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:03,987 INFO L225 Difference]: With dead ends: 15 [2025-04-30 10:21:03,987 INFO L226 Difference]: Without dead ends: 14 [2025-04-30 10:21:03,988 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:21:03,988 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:03,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 20 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:21:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2025-04-30 10:21:03,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2025-04-30 10:21:03,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2025-04-30 10:21:03,992 INFO L79 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2025-04-30 10:21:03,992 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:03,992 INFO L485 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2025-04-30 10:21:03,992 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:03,992 INFO L278 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2025-04-30 10:21:03,992 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:21:03,992 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:03,993 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:21:03,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:21:03,993 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:03,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:03,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1806873959, now seen corresponding path program 1 times [2025-04-30 10:21:03,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:03,993 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553007818] [2025-04-30 10:21:03,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:21:03,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:03,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:21:04,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:21:04,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:21:04,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:04,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553007818] [2025-04-30 10:21:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553007818] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:21:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:21:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:21:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179608302] [2025-04-30 10:21:04,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:21:04,037 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:21:04,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:04,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:21:04,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:21:04,037 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:04,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:04,047 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2025-04-30 10:21:04,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:21:04,048 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-04-30 10:21:04,048 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:04,048 INFO L225 Difference]: With dead ends: 14 [2025-04-30 10:21:04,048 INFO L226 Difference]: Without dead ends: 13 [2025-04-30 10:21:04,048 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:21:04,049 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 2 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:04,049 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 12 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:21:04,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-04-30 10:21:04,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-04-30 10:21:04,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 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-04-30 10:21:04,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-04-30 10:21:04,051 INFO L79 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2025-04-30 10:21:04,051 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:04,051 INFO L485 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-04-30 10:21:04,051 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:04,051 INFO L278 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-04-30 10:21:04,051 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:21:04,051 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:04,051 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:21:04,051 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:21:04,051 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:04,051 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash 178517930, now seen corresponding path program 1 times [2025-04-30 10:21:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:04,052 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856393398] [2025-04-30 10:21:04,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:21:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:04,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:21:04,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:21:04,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:21:04,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:04,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:04,092 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856393398] [2025-04-30 10:21:04,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856393398] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:21:04,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:21:04,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:21:04,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339204271] [2025-04-30 10:21:04,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:21:04,093 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:21:04,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:04,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:21:04,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:21:04,093 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:04,107 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2025-04-30 10:21:04,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:21:04,108 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-04-30 10:21:04,108 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:04,108 INFO L225 Difference]: With dead ends: 16 [2025-04-30 10:21:04,108 INFO L226 Difference]: Without dead ends: 15 [2025-04-30 10:21:04,108 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:21:04,109 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:04,109 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:21:04,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-04-30 10:21:04,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-04-30 10:21:04,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 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-04-30 10:21:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-04-30 10:21:04,112 INFO L79 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-04-30 10:21:04,112 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:04,112 INFO L485 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-04-30 10:21:04,113 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:04,113 INFO L278 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-04-30 10:21:04,113 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-30 10:21:04,113 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:04,113 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:21:04,113 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:21:04,113 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:04,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:04,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1058180961, now seen corresponding path program 1 times [2025-04-30 10:21:04,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:04,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875919091] [2025-04-30 10:21:04,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:21:04,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:04,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:21:04,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:21:04,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:21:04,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:04,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:04,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875919091] [2025-04-30 10:21:04,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875919091] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:21:04,183 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [590239314] [2025-04-30 10:21:04,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:21:04,183 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:04,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:21:04,185 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-04-30 10:21:04,186 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-04-30 10:21:04,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-30 10:21:04,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-30 10:21:04,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:21:04,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:04,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:21:04,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:21:04,252 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:04,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:21:04,300 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:04,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [590239314] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:21:04,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:21:04,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:21:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111994346] [2025-04-30 10:21:04,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:21:04,301 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:21:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:04,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:21:04,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:21:04,301 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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-04-30 10:21:04,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:04,343 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-04-30 10:21:04,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:21:04,345 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-04-30 10:21:04,345 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:04,345 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:21:04,345 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:21:04,345 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:21:04,346 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:04,346 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 30 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:21:04,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:21:04,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-04-30 10:21:04,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 27 states have internal predecessors, (30), 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-04-30 10:21:04,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2025-04-30 10:21:04,351 INFO L79 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 11 [2025-04-30 10:21:04,351 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:04,351 INFO L485 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2025-04-30 10:21:04,351 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 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-04-30 10:21:04,352 INFO L278 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2025-04-30 10:21:04,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-04-30 10:21:04,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:04,352 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-30 10:21:04,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-30 10:21:04,553 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:04,553 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:04,553 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:04,554 INFO L85 PathProgramCache]: Analyzing trace with hash -995344125, now seen corresponding path program 1 times [2025-04-30 10:21:04,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:04,554 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280633574] [2025-04-30 10:21:04,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:21:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:04,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:21:04,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:21:04,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:21:04,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:04,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:04,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:04,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280633574] [2025-04-30 10:21:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280633574] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:21:04,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102664440] [2025-04-30 10:21:04,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:21:04,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:04,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:21:04,608 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-04-30 10:21:04,609 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-04-30 10:21:04,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-04-30 10:21:04,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-04-30 10:21:04,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:21:04,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:04,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:21:04,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:21:04,661 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:04,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:21:04,702 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:04,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102664440] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:21:04,702 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:21:04,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:21:04,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265225917] [2025-04-30 10:21:04,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:21:04,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:21:04,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:04,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:21:04,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:21:04,703 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:04,742 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2025-04-30 10:21:04,742 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:21:04,742 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-04-30 10:21:04,742 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:04,742 INFO L225 Difference]: With dead ends: 31 [2025-04-30 10:21:04,742 INFO L226 Difference]: Without dead ends: 30 [2025-04-30 10:21:04,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:21:04,743 INFO L437 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:04,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:21:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-04-30 10:21:04,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-04-30 10:21:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 29 states have internal predecessors, (30), 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-04-30 10:21:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2025-04-30 10:21:04,746 INFO L79 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 13 [2025-04-30 10:21:04,746 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:04,746 INFO L485 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2025-04-30 10:21:04,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:04,746 INFO L278 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2025-04-30 10:21:04,746 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-04-30 10:21:04,746 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:04,746 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-04-30 10:21:04,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-30 10:21:04,950 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-30 10:21:04,950 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:04,950 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash -496145656, now seen corresponding path program 2 times [2025-04-30 10:21:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:04,950 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050334921] [2025-04-30 10:21:04,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:21:04,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:04,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-30 10:21:04,957 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 26 statements. [2025-04-30 10:21:04,957 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:21:04,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:21:04,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:04,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050334921] [2025-04-30 10:21:04,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050334921] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:21:04,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902195588] [2025-04-30 10:21:04,986 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:21:04,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:04,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:21:04,988 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-04-30 10:21:04,990 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-04-30 10:21:05,011 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-04-30 10:21:05,015 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 26 statements. [2025-04-30 10:21:05,015 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:21:05,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:05,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-30 10:21:05,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:21:05,060 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:21:05,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:21:05,107 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-04-30 10:21:05,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902195588] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:21:05,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:21:05,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-04-30 10:21:05,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447414472] [2025-04-30 10:21:05,108 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:21:05,108 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:21:05,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:05,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:21:05,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:21:05,108 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:05,123 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2025-04-30 10:21:05,123 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:21:05,123 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-04-30 10:21:05,123 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:05,124 INFO L225 Difference]: With dead ends: 30 [2025-04-30 10:21:05,124 INFO L226 Difference]: Without dead ends: 29 [2025-04-30 10:21:05,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:21:05,124 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:05,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 12 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:21:05,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-04-30 10:21:05,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-04-30 10:21:05,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 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-04-30 10:21:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2025-04-30 10:21:05,128 INFO L79 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2025-04-30 10:21:05,128 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:05,128 INFO L485 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2025-04-30 10:21:05,128 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:21:05,128 INFO L278 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2025-04-30 10:21:05,128 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-04-30 10:21:05,129 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:05,129 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-04-30 10:21:05,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-30 10:21:05,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:05,329 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:05,330 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:05,330 INFO L85 PathProgramCache]: Analyzing trace with hash -54604054, now seen corresponding path program 2 times [2025-04-30 10:21:05,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:05,330 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102847695] [2025-04-30 10:21:05,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:21:05,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:05,334 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:21:05,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:21:05,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:21:05,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:05,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:05,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102847695] [2025-04-30 10:21:05,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102847695] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:21:05,502 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1775768045] [2025-04-30 10:21:05,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:21:05,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:05,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:21:05,505 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-04-30 10:21:05,505 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-04-30 10:21:05,524 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-04-30 10:21:05,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-30 10:21:05,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:21:05,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:05,535 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:21:05,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:21:05,571 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:05,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:21:05,739 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:05,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1775768045] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:21:05,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:21:05,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-04-30 10:21:05,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736948894] [2025-04-30 10:21:05,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:21:05,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:21:05,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:05,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:21:05,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:21:05,741 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 22 states have internal predecessors, (54), 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-04-30 10:21:05,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:05,791 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2025-04-30 10:21:05,792 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:21:05,792 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-04-30 10:21:05,792 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:05,792 INFO L225 Difference]: With dead ends: 60 [2025-04-30 10:21:05,792 INFO L226 Difference]: Without dead ends: 59 [2025-04-30 10:21:05,793 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:21:05,793 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:05,793 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:21:05,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-04-30 10:21:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-04-30 10:21:05,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0172413793103448) internal successors, (59), 58 states have internal predecessors, (59), 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-04-30 10:21:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2025-04-30 10:21:05,797 INFO L79 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 28 [2025-04-30 10:21:05,797 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:05,797 INFO L485 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2025-04-30 10:21:05,797 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.5714285714285716) internal successors, (54), 22 states have internal predecessors, (54), 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-04-30 10:21:05,798 INFO L278 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2025-04-30 10:21:05,798 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-30 10:21:05,798 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:05,798 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 1, 1, 1, 1] [2025-04-30 10:21:05,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-30 10:21:06,000 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:06,001 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:06,001 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:06,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1591061046, now seen corresponding path program 3 times [2025-04-30 10:21:06,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:06,001 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126481526] [2025-04-30 10:21:06,001 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:21:06,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:06,008 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-04-30 10:21:06,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:21:06,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:21:06,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:06,445 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:06,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:06,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126481526] [2025-04-30 10:21:06,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126481526] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:21:06,446 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801378319] [2025-04-30 10:21:06,446 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:21:06,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:06,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:21:06,449 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-04-30 10:21:06,450 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-04-30 10:21:06,475 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 58 statements into 11 equivalence classes. [2025-04-30 10:21:06,493 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 58 of 58 statements. [2025-04-30 10:21:06,493 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:21:06,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:06,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:21:06,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:21:06,558 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:06,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:21:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:07,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801378319] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:21:07,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:21:07,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-04-30 10:21:07,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401421480] [2025-04-30 10:21:07,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:21:07,035 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-30 10:21:07,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:07,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-30 10:21:07,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:21:07,037 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand has 46 states, 45 states have (on average 2.533333333333333) internal successors, (114), 46 states have internal predecessors, (114), 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-04-30 10:21:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:07,117 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2025-04-30 10:21:07,117 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-30 10:21:07,117 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 2.533333333333333) internal successors, (114), 46 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2025-04-30 10:21:07,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:07,118 INFO L225 Difference]: With dead ends: 120 [2025-04-30 10:21:07,118 INFO L226 Difference]: Without dead ends: 119 [2025-04-30 10:21:07,119 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:21:07,119 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:07,119 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 68 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:21:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-04-30 10:21:07,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-04-30 10:21:07,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0084745762711864) internal successors, (119), 118 states have internal predecessors, (119), 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-04-30 10:21:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2025-04-30 10:21:07,131 INFO L79 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 58 [2025-04-30 10:21:07,131 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:07,131 INFO L485 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2025-04-30 10:21:07,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 2.533333333333333) internal successors, (114), 46 states have internal predecessors, (114), 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-04-30 10:21:07,131 INFO L278 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2025-04-30 10:21:07,133 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-04-30 10:21:07,133 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:07,133 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 1, 1, 1, 1] [2025-04-30 10:21:07,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-30 10:21:07,339 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:07,339 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:07,339 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:07,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1884189814, now seen corresponding path program 4 times [2025-04-30 10:21:07,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:07,340 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910066355] [2025-04-30 10:21:07,340 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:21:07,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:07,346 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 118 statements into 2 equivalence classes. [2025-04-30 10:21:07,386 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-04-30 10:21:07,386 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:21:07,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:08,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:08,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910066355] [2025-04-30 10:21:08,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910066355] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:21:08,501 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031993358] [2025-04-30 10:21:08,501 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:21:08,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:08,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:21:08,503 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-04-30 10:21:08,505 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-04-30 10:21:08,531 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 118 statements into 2 equivalence classes. [2025-04-30 10:21:08,575 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 118 of 118 statements. [2025-04-30 10:21:08,575 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:21:08,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:08,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-30 10:21:08,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:21:08,709 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:08,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:21:10,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 1265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:10,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031993358] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:21:10,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:21:10,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 93 [2025-04-30 10:21:10,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983177023] [2025-04-30 10:21:10,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:21:10,140 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 94 states [2025-04-30 10:21:10,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:10,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2025-04-30 10:21:10,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2025-04-30 10:21:10,147 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand has 94 states, 93 states have (on average 2.5161290322580645) internal successors, (234), 94 states have internal predecessors, (234), 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-04-30 10:21:10,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:10,326 INFO L93 Difference]: Finished difference Result 240 states and 263 transitions. [2025-04-30 10:21:10,326 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-04-30 10:21:10,327 INFO L79 Accepts]: Start accepts. Automaton has has 94 states, 93 states have (on average 2.5161290322580645) internal successors, (234), 94 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2025-04-30 10:21:10,329 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:10,330 INFO L225 Difference]: With dead ends: 240 [2025-04-30 10:21:10,331 INFO L226 Difference]: Without dead ends: 239 [2025-04-30 10:21:10,333 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2509 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2255, Invalid=6487, Unknown=0, NotChecked=0, Total=8742 [2025-04-30 10:21:10,334 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:10,334 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:21:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2025-04-30 10:21:10,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2025-04-30 10:21:10,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 238 states have (on average 1.004201680672269) internal successors, (239), 238 states have internal predecessors, (239), 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-04-30 10:21:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2025-04-30 10:21:10,348 INFO L79 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 118 [2025-04-30 10:21:10,349 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:10,349 INFO L485 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2025-04-30 10:21:10,350 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 94 states, 93 states have (on average 2.5161290322580645) internal successors, (234), 94 states have internal predecessors, (234), 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-04-30 10:21:10,350 INFO L278 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2025-04-30 10:21:10,355 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-04-30 10:21:10,355 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:10,356 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 1, 1, 1, 1] [2025-04-30 10:21:10,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-30 10:21:10,556 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:10,556 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:10,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:10,557 INFO L85 PathProgramCache]: Analyzing trace with hash 336107274, now seen corresponding path program 5 times [2025-04-30 10:21:10,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:10,557 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697427034] [2025-04-30 10:21:10,557 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:21:10,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:10,565 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 238 statements into 47 equivalence classes. [2025-04-30 10:21:10,640 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 238 of 238 statements. [2025-04-30 10:21:10,641 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-30 10:21:10,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:13,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:13,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697427034] [2025-04-30 10:21:13,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697427034] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:21:13,954 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86309805] [2025-04-30 10:21:13,954 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:21:13,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:13,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:21:13,956 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-04-30 10:21:13,957 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-04-30 10:21:13,992 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 238 statements into 47 equivalence classes. [2025-04-30 10:21:14,090 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 238 of 238 statements. [2025-04-30 10:21:14,090 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-30 10:21:14,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:14,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-04-30 10:21:14,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:21:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:14,335 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:21:18,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5405 backedges. 0 proven. 5405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86309805] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:21:18,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:21:18,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-04-30 10:21:18,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666748241] [2025-04-30 10:21:18,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:21:18,938 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-04-30 10:21:18,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:18,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-04-30 10:21:18,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-04-30 10:21:18,947 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand has 190 states, 189 states have (on average 2.507936507936508) internal successors, (474), 190 states have internal predecessors, (474), 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-04-30 10:21:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:19,339 INFO L93 Difference]: Finished difference Result 480 states and 527 transitions. [2025-04-30 10:21:19,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-04-30 10:21:19,340 INFO L79 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 2.507936507936508) internal successors, (474), 190 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2025-04-30 10:21:19,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:19,342 INFO L225 Difference]: With dead ends: 480 [2025-04-30 10:21:19,342 INFO L226 Difference]: Without dead ends: 479 [2025-04-30 10:21:19,344 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 569 GetRequests, 381 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10765 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-04-30 10:21:19,345 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:19,345 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 224 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:21:19,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-04-30 10:21:19,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-04-30 10:21:19,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 478 states have (on average 1.002092050209205) internal successors, (479), 478 states have internal predecessors, (479), 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-04-30 10:21:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2025-04-30 10:21:19,371 INFO L79 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 238 [2025-04-30 10:21:19,371 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:19,371 INFO L485 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2025-04-30 10:21:19,372 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 2.507936507936508) internal successors, (474), 190 states have internal predecessors, (474), 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-04-30 10:21:19,372 INFO L278 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2025-04-30 10:21:19,379 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-04-30 10:21:19,379 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:19,379 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 1, 1, 1, 1] [2025-04-30 10:21:19,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-30 10:21:19,580 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:19,580 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:19,580 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:19,580 INFO L85 PathProgramCache]: Analyzing trace with hash -99013110, now seen corresponding path program 6 times [2025-04-30 10:21:19,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:19,580 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798127065] [2025-04-30 10:21:19,580 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:21:19,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:19,594 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 478 statements into 95 equivalence classes. [2025-04-30 10:21:19,728 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 478 of 478 statements. [2025-04-30 10:21:19,729 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-04-30 10:21:19,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:31,301 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:31,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:21:31,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798127065] [2025-04-30 10:21:31,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798127065] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:21:31,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212084304] [2025-04-30 10:21:31,301 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:21:31,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:21:31,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:21:31,303 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-04-30 10:21:31,304 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-04-30 10:21:31,361 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 478 statements into 95 equivalence classes. [2025-04-30 10:21:31,598 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 478 of 478 statements. [2025-04-30 10:21:31,598 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-04-30 10:21:31,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:21:31,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 1260 conjuncts, 191 conjuncts are in the unsatisfiable core [2025-04-30 10:21:31,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:21:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:32,047 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:21:50,192 INFO L134 CoverageAnalysis]: Checked inductivity of 22325 backedges. 0 proven. 22325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:21:50,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212084304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:21:50,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:21:50,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 381 [2025-04-30 10:21:50,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156103935] [2025-04-30 10:21:50,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:21:50,193 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 382 states [2025-04-30 10:21:50,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:21:50,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 382 interpolants. [2025-04-30 10:21:50,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36671, Invalid=108871, Unknown=0, NotChecked=0, Total=145542 [2025-04-30 10:21:50,205 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand has 382 states, 381 states have (on average 2.5039370078740157) internal successors, (954), 382 states have internal predecessors, (954), 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-04-30 10:21:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:21:51,863 INFO L93 Difference]: Finished difference Result 960 states and 1055 transitions. [2025-04-30 10:21:51,863 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 382 states. [2025-04-30 10:21:51,864 INFO L79 Accepts]: Start accepts. Automaton has has 382 states, 381 states have (on average 2.5039370078740157) internal successors, (954), 382 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 478 [2025-04-30 10:21:51,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:21:51,867 INFO L225 Difference]: With dead ends: 960 [2025-04-30 10:21:51,867 INFO L226 Difference]: Without dead ends: 959 [2025-04-30 10:21:51,871 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 1145 GetRequests, 765 SyntacticMatches, 0 SemanticMatches, 380 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44557 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=36671, Invalid=108871, Unknown=0, NotChecked=0, Total=145542 [2025-04-30 10:21:51,872 INFO L437 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-30 10:21:51,872 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 414 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-30 10:21:51,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-04-30 10:21:51,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 959. [2025-04-30 10:21:51,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 958 states have (on average 1.001043841336117) internal successors, (959), 958 states have internal predecessors, (959), 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-04-30 10:21:51,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 959 transitions. [2025-04-30 10:21:51,897 INFO L79 Accepts]: Start accepts. Automaton has 959 states and 959 transitions. Word has length 478 [2025-04-30 10:21:51,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:21:51,898 INFO L485 AbstractCegarLoop]: Abstraction has 959 states and 959 transitions. [2025-04-30 10:21:51,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 382 states, 381 states have (on average 2.5039370078740157) internal successors, (954), 382 states have internal predecessors, (954), 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-04-30 10:21:51,898 INFO L278 IsEmpty]: Start isEmpty. Operand 959 states and 959 transitions. [2025-04-30 10:21:51,910 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 959 [2025-04-30 10:21:51,910 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:21:51,910 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 190, 1, 1, 1, 1] [2025-04-30 10:21:51,918 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-30 10:21:52,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-30 10:21:52,111 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:21:52,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:21:52,112 INFO L85 PathProgramCache]: Analyzing trace with hash -37463030, now seen corresponding path program 7 times [2025-04-30 10:21:52,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:21:52,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637869409] [2025-04-30 10:21:52,112 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-30 10:21:52,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:21:52,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 958 statements into 1 equivalence classes. [2025-04-30 10:21:52,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 958 of 958 statements. [2025-04-30 10:21:52,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:21:52,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15