./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/loop-zilu/benchmark36_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/benchmark36_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 aa1583b531c18e8d25726690525e5ca2db800c1fca35b7cfde3a7fa11382718a --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:21:57,348 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:21:57,396 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:57,401 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:21:57,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:21:57,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:21:57,422 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:21:57,422 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:21:57,423 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-30 10:21:57,423 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-30 10:21:57,423 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:21:57,424 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:21:57,424 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:21:57,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:21:57,424 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:21:57,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:21:57,425 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:21:57,425 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:21:57,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:21:57,427 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:21:57,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:21:57,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:21:57,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:21:57,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:21:57,427 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:21:57,427 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:21:57,427 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-30 10:21:57,427 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:21:57,428 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:21:57,428 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa1583b531c18e8d25726690525e5ca2db800c1fca35b7cfde3a7fa11382718a [2025-04-30 10:21:57,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:21:57,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:21:57,642 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:21:57,643 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:21:57,643 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:21:57,644 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-zilu/benchmark36_conjunctive.i [2025-04-30 10:21:58,932 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cbe496cd/5392072ef9844417aa57e9280e88045b/FLAG3f6c00fd1 [2025-04-30 10:21:59,101 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:21:59,101 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-zilu/benchmark36_conjunctive.i [2025-04-30 10:21:59,107 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cbe496cd/5392072ef9844417aa57e9280e88045b/FLAG3f6c00fd1 [2025-04-30 10:21:59,982 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2cbe496cd/5392072ef9844417aa57e9280e88045b [2025-04-30 10:21:59,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:21:59,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:21:59,986 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:21:59,986 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:21:59,989 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:21:59,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:21:59" (1/1) ... [2025-04-30 10:21:59,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a466493 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:21:59, skipping insertion in model container [2025-04-30 10:21:59,990 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:21:59" (1/1) ... [2025-04-30 10:21:59,998 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:22:00,140 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:22:00,146 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:22:00,171 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:22:00,182 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:22:00,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00 WrapperNode [2025-04-30 10:22:00,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:22:00,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:22:00,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:22:00,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:22:00,190 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:22:00" (1/1) ... [2025-04-30 10:22:00,196 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:22:00" (1/1) ... [2025-04-30 10:22:00,209 INFO L138 Inliner]: procedures = 15, calls = 8, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 44 [2025-04-30 10:22:00,210 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:22:00,210 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:22:00,211 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:22:00,211 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:22:00,216 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,216 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,217 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,227 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:22:00,230 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,230 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,232 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,235 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:22:00,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:22:00,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:22:00,242 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:22:00,243 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (1/1) ... [2025-04-30 10:22:00,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:22:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:00,267 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:22:00,269 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:22:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:22:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-30 10:22:00,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:22:00,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:22:00,316 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:22:00,317 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:22:00,392 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2025-04-30 10:22:00,392 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:22:00,397 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:22:00,397 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-04-30 10:22:00,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:00 BoogieIcfgContainer [2025-04-30 10:22:00,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:22:00,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:22:00,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:22:00,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:22:00,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:21:59" (1/3) ... [2025-04-30 10:22:00,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4b492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:22:00, skipping insertion in model container [2025-04-30 10:22:00,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:22:00" (2/3) ... [2025-04-30 10:22:00,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46d4b492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:22:00, skipping insertion in model container [2025-04-30 10:22:00,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:22:00" (3/3) ... [2025-04-30 10:22:00,403 INFO L128 eAbstractionObserver]: Analyzing ICFG benchmark36_conjunctive.i [2025-04-30 10:22:00,416 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:22:00,417 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG benchmark36_conjunctive.i that has 1 procedures, 22 locations, 26 edges, 1 initial locations, 1 loop locations, and 4 error locations. [2025-04-30 10:22:00,453 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:22:00,461 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;@2eb9f82e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:22:00,461 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-30 10:22:00,463 INFO L278 IsEmpty]: Start isEmpty. Operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 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:22:00,466 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-30 10:22:00,466 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:00,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:00,467 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:22:00,469 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:00,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1806875016, now seen corresponding path program 1 times [2025-04-30 10:22:00,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:00,474 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895334963] [2025-04-30 10:22:00,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:00,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:00,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-30 10:22:00,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-30 10:22:00,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:00,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:00,602 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:22:00,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:00,602 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895334963] [2025-04-30 10:22:00,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895334963] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:00,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:00,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:00,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662593415] [2025-04-30 10:22:00,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:00,607 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:00,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:00,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:00,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:00,620 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 21 states have internal predecessors, (26), 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 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:22:00,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:00,658 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2025-04-30 10:22:00,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:00,659 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:22:00,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:00,664 INFO L225 Difference]: With dead ends: 29 [2025-04-30 10:22:00,664 INFO L226 Difference]: Without dead ends: 13 [2025-04-30 10:22:00,665 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:22:00,668 INFO L437 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:00,668 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 31 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-04-30 10:22:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-04-30 10:22:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) 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:22:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2025-04-30 10:22:00,687 INFO L79 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2025-04-30 10:22:00,687 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:00,688 INFO L485 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2025-04-30 10:22:00,688 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:22:00,688 INFO L278 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2025-04-30 10:22:00,688 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-04-30 10:22:00,688 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:00,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:00,688 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:22:00,689 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:22:00,689 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:00,689 INFO L85 PathProgramCache]: Analyzing trace with hash 178550700, now seen corresponding path program 1 times [2025-04-30 10:22:00,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:00,689 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583965205] [2025-04-30 10:22:00,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:00,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:00,693 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-30 10:22:00,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-30 10:22:00,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:00,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:00,734 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:22:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:00,734 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583965205] [2025-04-30 10:22:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583965205] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:00,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377592719] [2025-04-30 10:22:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:00,735 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:00,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:00,735 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:22:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:00,754 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2025-04-30 10:22:00,754 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:00,754 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:22:00,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:00,754 INFO L225 Difference]: With dead ends: 19 [2025-04-30 10:22:00,754 INFO L226 Difference]: Without dead ends: 18 [2025-04-30 10:22:00,755 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:22:00,755 INFO L437 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 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:22:00,755 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:00,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-04-30 10:22:00,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-04-30 10:22:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 1.2) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:00,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2025-04-30 10:22:00,760 INFO L79 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 8 [2025-04-30 10:22:00,760 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:00,760 INFO L485 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2025-04-30 10:22:00,761 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:22:00,761 INFO L278 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2025-04-30 10:22:00,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-04-30 10:22:00,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:00,761 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:00,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:22:00,762 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:22:00,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1240104458, now seen corresponding path program 1 times [2025-04-30 10:22:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:00,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749074567] [2025-04-30 10:22:00,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:00,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-30 10:22:00,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-30 10:22:00,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:00,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:00,814 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:22:00,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:00,815 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749074567] [2025-04-30 10:22:00,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749074567] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:00,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:00,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:00,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850080611] [2025-04-30 10:22:00,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:00,815 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:00,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:00,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:00,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:00,816 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:22:00,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:00,827 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2025-04-30 10:22:00,827 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:00,828 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2025-04-30 10:22:00,828 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:00,828 INFO L225 Difference]: With dead ends: 18 [2025-04-30 10:22:00,828 INFO L226 Difference]: Without dead ends: 17 [2025-04-30 10:22:00,828 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:22:00,829 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 16 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:22:00,829 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 16 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:00,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2025-04-30 10:22:00,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2025-04-30 10:22:00,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 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:22:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2025-04-30 10:22:00,831 INFO L79 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 9 [2025-04-30 10:22:00,831 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:00,831 INFO L485 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2025-04-30 10:22:00,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:22:00,832 INFO L278 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2025-04-30 10:22:00,832 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-04-30 10:22:00,832 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:00,832 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:00,832 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:22:00,832 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:22:00,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -211467410, now seen corresponding path program 1 times [2025-04-30 10:22:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:00,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808764843] [2025-04-30 10:22:00,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:00,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-30 10:22:00,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-30 10:22:00,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:00,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:00,863 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:22:00,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:00,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808764843] [2025-04-30 10:22:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808764843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:22:00,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:22:00,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:22:00,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456483114] [2025-04-30 10:22:00,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:22:00,864 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-30 10:22:00,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:00,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-30 10:22:00,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-30 10:22:00,865 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:22:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:00,876 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2025-04-30 10:22:00,876 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-30 10:22:00,876 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 10 [2025-04-30 10:22:00,876 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:00,877 INFO L225 Difference]: With dead ends: 20 [2025-04-30 10:22:00,877 INFO L226 Difference]: Without dead ends: 19 [2025-04-30 10:22:00,877 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:22:00,877 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 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:22:00,878 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-04-30 10:22:00,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-04-30 10:22:00,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2025-04-30 10:22:00,880 INFO L79 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 10 [2025-04-30 10:22:00,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:00,880 INFO L485 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2025-04-30 10:22:00,881 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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:22:00,881 INFO L278 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2025-04-30 10:22:00,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-30 10:22:00,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:00,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:22:00,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:22:00,881 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:22:00,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:00,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1987588033, now seen corresponding path program 1 times [2025-04-30 10:22:00,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:00,882 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775014801] [2025-04-30 10:22:00,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:00,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:22:00,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:22:00,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:00,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:00,968 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:22:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:00,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775014801] [2025-04-30 10:22:00,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775014801] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:00,969 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1149292630] [2025-04-30 10:22:00,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:00,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:00,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:00,971 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:22:00,973 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:22:00,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-30 10:22:01,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-30 10:22:01,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:01,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:01,005 INFO L256 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-30 10:22:01,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:01,065 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:22:01,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:01,115 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:22:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1149292630] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:01,115 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:01,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:22:01,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383351510] [2025-04-30 10:22:01,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:01,116 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:22:01,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:01,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:22:01,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:22:01,117 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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:22:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:01,156 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-04-30 10:22:01,157 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:22:01,157 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-30 10:22:01,157 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:01,157 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:22:01,158 INFO L226 Difference]: Without dead ends: 40 [2025-04-30 10:22:01,158 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 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:22:01,158 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:01,159 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 53 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:01,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-30 10:22:01,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2025-04-30 10:22:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 37 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2025-04-30 10:22:01,166 INFO L79 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 15 [2025-04-30 10:22:01,167 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:01,167 INFO L485 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2025-04-30 10:22:01,168 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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:22:01,168 INFO L278 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2025-04-30 10:22:01,168 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-30 10:22:01,168 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:01,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-04-30 10:22:01,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-30 10:22:01,372 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:22:01,372 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:22:01,373 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:01,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1188345277, now seen corresponding path program 1 times [2025-04-30 10:22:01,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:01,373 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396348682] [2025-04-30 10:22:01,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:01,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:01,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:22:01,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:22:01,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:01,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:01,443 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:01,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:01,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396348682] [2025-04-30 10:22:01,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396348682] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:01,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012243595] [2025-04-30 10:22:01,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:22:01,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:01,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:01,445 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:22:01,447 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:22:01,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-30 10:22:01,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-30 10:22:01,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:22:01,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:01,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-30 10:22:01,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:01,511 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:01,556 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:01,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012243595] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:01,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:01,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-04-30 10:22:01,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984820054] [2025-04-30 10:22:01,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:01,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-30 10:22:01,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:01,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-30 10:22:01,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-30 10:22:01,557 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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:22:01,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:01,594 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2025-04-30 10:22:01,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:22:01,594 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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 17 [2025-04-30 10:22:01,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:01,595 INFO L225 Difference]: With dead ends: 41 [2025-04-30 10:22:01,595 INFO L226 Difference]: Without dead ends: 40 [2025-04-30 10:22:01,595 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 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:22:01,595 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 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:22:01,596 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:01,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-04-30 10:22:01,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-04-30 10:22:01,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:01,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2025-04-30 10:22:01,604 INFO L79 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 17 [2025-04-30 10:22:01,605 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:01,605 INFO L485 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2025-04-30 10:22:01,605 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 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:22:01,605 INFO L278 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2025-04-30 10:22:01,605 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-04-30 10:22:01,606 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:01,606 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 1, 1, 1, 1] [2025-04-30 10:22:01,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:01,806 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:22:01,807 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:22:01,807 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:01,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1142369388, now seen corresponding path program 2 times [2025-04-30 10:22:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:01,807 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633625851] [2025-04-30 10:22:01,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:01,815 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:22:01,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:22:01,833 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:22:01,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:01,999 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:01,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:01,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633625851] [2025-04-30 10:22:01,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633625851] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:01,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030690360] [2025-04-30 10:22:01,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:01,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:02,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:02,002 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:22:02,003 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:22:02,026 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-30 10:22:02,036 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-30 10:22:02,036 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:22:02,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:02,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-30 10:22:02,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:02,091 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:02,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:02,233 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1030690360] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:02,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:02,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-04-30 10:22:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269228688] [2025-04-30 10:22:02,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:02,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:22:02,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:02,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:22:02,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:22:02,234 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 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:22:02,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:02,298 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2025-04-30 10:22:02,298 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:22:02,298 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 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 36 [2025-04-30 10:22:02,298 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:02,299 INFO L225 Difference]: With dead ends: 86 [2025-04-30 10:22:02,299 INFO L226 Difference]: Without dead ends: 85 [2025-04-30 10:22:02,299 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:22:02,300 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:02,301 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 83 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:22:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-04-30 10:22:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 80. [2025-04-30 10:22:02,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.0897435897435896) internal successors, (85), 79 states have internal predecessors, (85), 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:22:02,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2025-04-30 10:22:02,308 INFO L79 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 36 [2025-04-30 10:22:02,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:02,309 INFO L485 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2025-04-30 10:22:02,309 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 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:22:02,309 INFO L278 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2025-04-30 10:22:02,309 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-04-30 10:22:02,309 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:02,309 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-04-30 10:22:02,315 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:22:02,510 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:22:02,510 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:22:02,510 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1694644178, now seen corresponding path program 2 times [2025-04-30 10:22:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:02,511 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014825990] [2025-04-30 10:22:02,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:02,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:02,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:22:02,525 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:22:02,525 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:22:02,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:02,650 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:02,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:02,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014825990] [2025-04-30 10:22:02,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014825990] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:02,651 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619889899] [2025-04-30 10:22:02,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:22:02,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:02,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:02,653 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:22:02,655 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:22:02,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-30 10:22:02,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-30 10:22:02,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-30 10:22:02,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:02,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-30 10:22:02,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:02,736 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:02,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:02,882 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:02,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619889899] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:02,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:02,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-04-30 10:22:02,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896876609] [2025-04-30 10:22:02,883 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:02,883 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-30 10:22:02,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:02,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-30 10:22:02,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:22:02,884 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 22 states have internal predecessors, (74), 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:22:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:02,933 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2025-04-30 10:22:02,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-30 10:22:02,934 INFO L79 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 22 states have internal predecessors, (74), 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 38 [2025-04-30 10:22:02,934 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:02,934 INFO L225 Difference]: With dead ends: 83 [2025-04-30 10:22:02,934 INFO L226 Difference]: Without dead ends: 82 [2025-04-30 10:22:02,934 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-04-30 10:22:02,935 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:02,935 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-30 10:22:02,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-04-30 10:22:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-04-30 10:22:02,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 80 states have (on average 1.025) internal successors, (82), 81 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:02,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2025-04-30 10:22:02,941 INFO L79 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 38 [2025-04-30 10:22:02,941 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:02,941 INFO L485 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2025-04-30 10:22:02,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.5238095238095237) internal successors, (74), 22 states have internal predecessors, (74), 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:22:02,944 INFO L278 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2025-04-30 10:22:02,944 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-04-30 10:22:02,944 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:02,945 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1] [2025-04-30 10:22:02,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:03,145 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:22:03,145 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:03,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:03,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1206235252, now seen corresponding path program 3 times [2025-04-30 10:22:03,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:03,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469158903] [2025-04-30 10:22:03,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:22:03,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:03,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-04-30 10:22:03,170 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-04-30 10:22:03,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:22:03,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:03,585 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:03,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:03,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469158903] [2025-04-30 10:22:03,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469158903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:03,586 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783858548] [2025-04-30 10:22:03,586 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:22:03,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:03,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:03,588 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:22:03,589 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:22:03,612 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 78 statements into 11 equivalence classes. [2025-04-30 10:22:03,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 78 of 78 statements. [2025-04-30 10:22:03,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:22:03,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:03,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-30 10:22:03,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:03,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:04,198 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 0 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:04,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783858548] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:04,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:04,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-04-30 10:22:04,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874477218] [2025-04-30 10:22:04,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:04,199 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-30 10:22:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:04,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-30 10:22:04,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:22:04,201 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand has 46 states, 45 states have (on average 3.422222222222222) internal successors, (154), 46 states have internal predecessors, (154), 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:22:04,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:04,291 INFO L93 Difference]: Finished difference Result 176 states and 187 transitions. [2025-04-30 10:22:04,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-30 10:22:04,292 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.422222222222222) internal successors, (154), 46 states have internal predecessors, (154), 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 78 [2025-04-30 10:22:04,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:04,293 INFO L225 Difference]: With dead ends: 176 [2025-04-30 10:22:04,293 INFO L226 Difference]: Without dead ends: 175 [2025-04-30 10:22:04,293 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:22:04,294 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 138 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:22:04,294 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 138 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:22:04,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2025-04-30 10:22:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 164. [2025-04-30 10:22:04,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.0802469135802468) internal successors, (175), 163 states have internal predecessors, (175), 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:22:04,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 175 transitions. [2025-04-30 10:22:04,307 INFO L79 Accepts]: Start accepts. Automaton has 164 states and 175 transitions. Word has length 78 [2025-04-30 10:22:04,308 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:04,308 INFO L485 AbstractCegarLoop]: Abstraction has 164 states and 175 transitions. [2025-04-30 10:22:04,308 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.422222222222222) internal successors, (154), 46 states have internal predecessors, (154), 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:22:04,308 INFO L278 IsEmpty]: Start isEmpty. Operand 164 states and 175 transitions. [2025-04-30 10:22:04,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-04-30 10:22:04,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:04,308 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1] [2025-04-30 10:22:04,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:04,509 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:22:04,509 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:22:04,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash 449094478, now seen corresponding path program 3 times [2025-04-30 10:22:04,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:04,510 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957366310] [2025-04-30 10:22:04,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:22:04,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:04,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 11 equivalence classes. [2025-04-30 10:22:04,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:22:04,528 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:22:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:04,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:04,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957366310] [2025-04-30 10:22:04,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957366310] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:04,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281687200] [2025-04-30 10:22:04,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:22:04,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:04,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:04,868 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:22:04,869 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:22:04,893 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 80 statements into 11 equivalence classes. [2025-04-30 10:22:04,914 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 80 of 80 statements. [2025-04-30 10:22:04,914 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-30 10:22:04,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:04,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-04-30 10:22:04,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:04,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:05,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281687200] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:05,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:05,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-04-30 10:22:05,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203984952] [2025-04-30 10:22:05,454 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:05,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-30 10:22:05,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:05,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-30 10:22:05,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:22:05,455 INFO L87 Difference]: Start difference. First operand 164 states and 175 transitions. Second operand has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 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:22:05,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:05,539 INFO L93 Difference]: Finished difference Result 167 states and 178 transitions. [2025-04-30 10:22:05,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-30 10:22:05,539 INFO L79 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 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 80 [2025-04-30 10:22:05,540 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:05,540 INFO L225 Difference]: With dead ends: 167 [2025-04-30 10:22:05,540 INFO L226 Difference]: Without dead ends: 166 [2025-04-30 10:22:05,541 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-04-30 10:22:05,542 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:05,542 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:22:05,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-04-30 10:22:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2025-04-30 10:22:05,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 164 states have (on average 1.0121951219512195) internal successors, (166), 165 states have internal predecessors, (166), 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:22:05,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2025-04-30 10:22:05,549 INFO L79 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 80 [2025-04-30 10:22:05,549 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:05,550 INFO L485 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2025-04-30 10:22:05,550 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 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:22:05,550 INFO L278 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2025-04-30 10:22:05,551 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-04-30 10:22:05,551 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:05,551 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 1, 1, 1, 1] [2025-04-30 10:22:05,557 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:22:05,754 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:22:05,754 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:05,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:05,754 INFO L85 PathProgramCache]: Analyzing trace with hash 532209100, now seen corresponding path program 4 times [2025-04-30 10:22:05,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:05,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381329226] [2025-04-30 10:22:05,755 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:22:05,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:05,763 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 162 statements into 2 equivalence classes. [2025-04-30 10:22:05,780 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 162 of 162 statements. [2025-04-30 10:22:05,780 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:22:05,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:07,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:07,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381329226] [2025-04-30 10:22:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381329226] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:07,214 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620735691] [2025-04-30 10:22:07,214 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:22:07,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:07,217 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:22:07,219 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:22:07,251 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 162 statements into 2 equivalence classes. [2025-04-30 10:22:07,279 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 162 of 162 statements. [2025-04-30 10:22:07,279 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:22:07,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:07,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-04-30 10:22:07,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:07,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:07,456 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1727 backedges. 0 proven. 1727 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:08,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620735691] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:08,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:08,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47, 47] total 95 [2025-04-30 10:22:08,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075784624] [2025-04-30 10:22:08,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:08,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-04-30 10:22:08,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:08,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-04-30 10:22:08,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2025-04-30 10:22:08,902 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand has 96 states, 95 states have (on average 3.4526315789473685) internal successors, (328), 96 states have internal predecessors, (328), 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:22:09,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:09,062 INFO L93 Difference]: Finished difference Result 356 states and 379 transitions. [2025-04-30 10:22:09,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2025-04-30 10:22:09,062 INFO L79 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 3.4526315789473685) internal successors, (328), 96 states have internal predecessors, (328), 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 162 [2025-04-30 10:22:09,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:09,063 INFO L225 Difference]: With dead ends: 356 [2025-04-30 10:22:09,063 INFO L226 Difference]: Without dead ends: 355 [2025-04-30 10:22:09,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2823 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2351, Invalid=6769, Unknown=0, NotChecked=0, Total=9120 [2025-04-30 10:22:09,065 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 54 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:09,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 258 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:22:09,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2025-04-30 10:22:09,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 332. [2025-04-30 10:22:09,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 330 states have (on average 1.0757575757575757) internal successors, (355), 331 states have internal predecessors, (355), 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:22:09,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 355 transitions. [2025-04-30 10:22:09,074 INFO L79 Accepts]: Start accepts. Automaton has 332 states and 355 transitions. Word has length 162 [2025-04-30 10:22:09,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:09,074 INFO L485 AbstractCegarLoop]: Abstraction has 332 states and 355 transitions. [2025-04-30 10:22:09,074 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 3.4526315789473685) internal successors, (328), 96 states have internal predecessors, (328), 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:22:09,075 INFO L278 IsEmpty]: Start isEmpty. Operand 332 states and 355 transitions. [2025-04-30 10:22:09,076 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-04-30 10:22:09,076 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:09,076 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 22, 1, 1, 1, 1] [2025-04-30 10:22:09,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:09,280 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:22:09,280 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:22:09,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:09,280 INFO L85 PathProgramCache]: Analyzing trace with hash 351838606, now seen corresponding path program 4 times [2025-04-30 10:22:09,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:09,280 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122173484] [2025-04-30 10:22:09,280 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:22:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:09,286 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-04-30 10:22:09,308 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:22:09,308 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:22:09,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:10,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:10,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:10,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122173484] [2025-04-30 10:22:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122173484] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:10,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055841599] [2025-04-30 10:22:10,318 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-30 10:22:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:10,320 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:22:10,320 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:22:10,345 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-04-30 10:22:10,370 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-04-30 10:22:10,370 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-30 10:22:10,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:10,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-30 10:22:10,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:10,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:11,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1771 backedges. 0 proven. 1771 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:11,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055841599] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:11,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:11,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 47, 47] total 95 [2025-04-30 10:22:11,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125410563] [2025-04-30 10:22:11,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:11,799 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2025-04-30 10:22:11,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:11,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2025-04-30 10:22:11,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2352, Invalid=6768, Unknown=0, NotChecked=0, Total=9120 [2025-04-30 10:22:11,802 INFO L87 Difference]: Start difference. First operand 332 states and 355 transitions. Second operand has 96 states, 95 states have (on average 3.4947368421052634) internal successors, (332), 96 states have internal predecessors, (332), 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:22:11,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:11,970 INFO L93 Difference]: Finished difference Result 335 states and 358 transitions. [2025-04-30 10:22:11,970 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-04-30 10:22:11,970 INFO L79 Accepts]: Start accepts. Automaton has has 96 states, 95 states have (on average 3.4947368421052634) internal successors, (332), 96 states have internal predecessors, (332), 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 164 [2025-04-30 10:22:11,971 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:11,972 INFO L225 Difference]: With dead ends: 335 [2025-04-30 10:22:11,972 INFO L226 Difference]: Without dead ends: 334 [2025-04-30 10:22:11,974 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 374 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2711 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2352, Invalid=6768, Unknown=0, NotChecked=0, Total=9120 [2025-04-30 10:22:11,974 INFO L437 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:11,974 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-30 10:22:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-30 10:22:11,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2025-04-30 10:22:11,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 332 states have (on average 1.0060240963855422) internal successors, (334), 333 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:22:11,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2025-04-30 10:22:11,982 INFO L79 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 164 [2025-04-30 10:22:11,982 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:11,982 INFO L485 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2025-04-30 10:22:11,982 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 95 states have (on average 3.4947368421052634) internal successors, (332), 96 states have internal predecessors, (332), 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:22:11,982 INFO L278 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2025-04-30 10:22:11,985 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-04-30 10:22:11,985 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:11,985 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 46, 46, 46, 1, 1, 1, 1] [2025-04-30 10:22:11,992 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:22:12,185 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:22:12,186 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:12,186 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:12,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1701897652, now seen corresponding path program 5 times [2025-04-30 10:22:12,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:12,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268268561] [2025-04-30 10:22:12,186 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:22:12,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:12,195 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 330 statements into 47 equivalence classes. [2025-04-30 10:22:12,311 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 330 of 330 statements. [2025-04-30 10:22:12,312 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-30 10:22:12,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:15,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7475 backedges. 0 proven. 7475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:15,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:15,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268268561] [2025-04-30 10:22:15,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268268561] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:15,745 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57229770] [2025-04-30 10:22:15,745 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:22:15,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:15,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:15,747 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:15,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-30 10:22:15,785 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 330 statements into 47 equivalence classes. [2025-04-30 10:22:15,932 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 330 of 330 statements. [2025-04-30 10:22:15,932 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-30 10:22:15,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:15,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 675 conjuncts, 96 conjuncts are in the unsatisfiable core [2025-04-30 10:22:15,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:16,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7475 backedges. 0 proven. 7475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:16,196 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 7475 backedges. 0 proven. 7475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:20,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57229770] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:20,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:20,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-04-30 10:22:20,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982497607] [2025-04-30 10:22:20,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:20,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-04-30 10:22:20,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:20,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-04-30 10:22:20,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-04-30 10:22:20,826 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand has 190 states, 189 states have (on average 3.4814814814814814) internal successors, (658), 190 states have internal predecessors, (658), 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:22:21,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:21,280 INFO L93 Difference]: Finished difference Result 716 states and 763 transitions. [2025-04-30 10:22:21,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-04-30 10:22:21,281 INFO L79 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 3.4814814814814814) internal successors, (658), 190 states have internal predecessors, (658), 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 330 [2025-04-30 10:22:21,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:21,283 INFO L225 Difference]: With dead ends: 716 [2025-04-30 10:22:21,283 INFO L226 Difference]: Without dead ends: 715 [2025-04-30 10:22:21,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 753 GetRequests, 565 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:22:21,285 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 215 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:21,285 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 480 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:22:21,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2025-04-30 10:22:21,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 668. [2025-04-30 10:22:21,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 666 states have (on average 1.0735735735735736) internal successors, (715), 667 states have internal predecessors, (715), 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:22:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 715 transitions. [2025-04-30 10:22:21,298 INFO L79 Accepts]: Start accepts. Automaton has 668 states and 715 transitions. Word has length 330 [2025-04-30 10:22:21,298 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:21,298 INFO L485 AbstractCegarLoop]: Abstraction has 668 states and 715 transitions. [2025-04-30 10:22:21,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 3.4814814814814814) internal successors, (658), 190 states have internal predecessors, (658), 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:22:21,299 INFO L278 IsEmpty]: Start isEmpty. Operand 668 states and 715 transitions. [2025-04-30 10:22:21,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2025-04-30 10:22:21,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:21,301 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 46, 1, 1, 1, 1] [2025-04-30 10:22:21,308 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-30 10:22:21,502 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-30 10:22:21,502 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:21,502 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:21,502 INFO L85 PathProgramCache]: Analyzing trace with hash 858897934, now seen corresponding path program 5 times [2025-04-30 10:22:21,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:21,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136451692] [2025-04-30 10:22:21,502 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:22:21,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:21,511 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 332 statements into 47 equivalence classes. [2025-04-30 10:22:21,580 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 332 of 332 statements. [2025-04-30 10:22:21,581 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-30 10:22:21,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:24,465 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:24,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:24,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136451692] [2025-04-30 10:22:24,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136451692] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:24,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591052126] [2025-04-30 10:22:24,465 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-30 10:22:24,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:24,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:24,468 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:24,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-30 10:22:24,508 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 332 statements into 47 equivalence classes. [2025-04-30 10:22:24,653 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 332 of 332 statements. [2025-04-30 10:22:24,653 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-04-30 10:22:24,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:24,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-04-30 10:22:24,662 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:24,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:24,957 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:22:29,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7567 backedges. 0 proven. 7567 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:29,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591052126] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:22:29,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:22:29,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-04-30 10:22:29,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87590695] [2025-04-30 10:22:29,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:22:29,827 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-04-30 10:22:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:22:29,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-04-30 10:22:29,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-04-30 10:22:29,831 INFO L87 Difference]: Start difference. First operand 668 states and 715 transitions. Second operand has 190 states, 189 states have (on average 3.502645502645503) internal successors, (662), 190 states have internal predecessors, (662), 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:22:30,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-30 10:22:30,317 INFO L93 Difference]: Finished difference Result 671 states and 718 transitions. [2025-04-30 10:22:30,318 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-04-30 10:22:30,318 INFO L79 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 3.502645502645503) internal successors, (662), 190 states have internal predecessors, (662), 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 332 [2025-04-30 10:22:30,319 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-30 10:22:30,321 INFO L225 Difference]: With dead ends: 671 [2025-04-30 10:22:30,321 INFO L226 Difference]: Without dead ends: 670 [2025-04-30 10:22:30,323 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 757 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10765 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-04-30 10:22:30,323 INFO L437 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-30 10:22:30,323 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-30 10:22:30,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2025-04-30 10:22:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2025-04-30 10:22:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 668 states have (on average 1.0029940119760479) internal successors, (670), 669 states have internal predecessors, (670), 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:22:30,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 670 transitions. [2025-04-30 10:22:30,337 INFO L79 Accepts]: Start accepts. Automaton has 670 states and 670 transitions. Word has length 332 [2025-04-30 10:22:30,337 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-30 10:22:30,337 INFO L485 AbstractCegarLoop]: Abstraction has 670 states and 670 transitions. [2025-04-30 10:22:30,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 3.502645502645503) internal successors, (662), 190 states have internal predecessors, (662), 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:22:30,338 INFO L278 IsEmpty]: Start isEmpty. Operand 670 states and 670 transitions. [2025-04-30 10:22:30,344 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-04-30 10:22:30,345 INFO L210 NwaCegarLoop]: Found error trace [2025-04-30 10:22:30,345 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 94, 94, 94, 1, 1, 1, 1] [2025-04-30 10:22:30,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-30 10:22:30,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-30 10:22:30,545 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-04-30 10:22:30,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:22:30,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1268772020, now seen corresponding path program 6 times [2025-04-30 10:22:30,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:22:30,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853355303] [2025-04-30 10:22:30,546 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:22:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:22:30,561 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 666 statements into 95 equivalence classes. [2025-04-30 10:22:30,920 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 666 of 666 statements. [2025-04-30 10:22:30,921 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-04-30 10:22:30,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 31067 backedges. 0 proven. 31067 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:44,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:22:44,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853355303] [2025-04-30 10:22:44,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853355303] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-30 10:22:44,179 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258127866] [2025-04-30 10:22:44,179 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-30 10:22:44,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-30 10:22:44,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:22:44,181 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-30 10:22:44,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-30 10:22:44,246 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 666 statements into 95 equivalence classes. [2025-04-30 10:22:44,833 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 666 of 666 statements. [2025-04-30 10:22:44,833 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-04-30 10:22:44,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:22:44,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1347 conjuncts, 192 conjuncts are in the unsatisfiable core [2025-04-30 10:22:44,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-30 10:22:45,302 INFO L134 CoverageAnalysis]: Checked inductivity of 31067 backedges. 0 proven. 31067 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:22:45,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-30 10:23:03,942 INFO L134 CoverageAnalysis]: Checked inductivity of 31067 backedges. 0 proven. 31067 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:23:03,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258127866] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-30 10:23:03,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-30 10:23:03,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [191, 191, 191] total 381 [2025-04-30 10:23:03,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124973208] [2025-04-30 10:23:03,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-30 10:23:03,944 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 382 states [2025-04-30 10:23:03,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:23:03,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 382 interpolants. [2025-04-30 10:23:03,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36671, Invalid=108871, Unknown=0, NotChecked=0, Total=145542 [2025-04-30 10:23:03,957 INFO L87 Difference]: Start difference. First operand 670 states and 670 transitions. Second operand has 382 states, 381 states have (on average 3.490813648293963) internal successors, (1330), 382 states have internal predecessors, (1330), 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) Killed by 15