./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b7e15211580ea4e53f751b22847dfea4720c9dc42574c861d991d991eb47919b --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:32:10,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:32:10,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 10:32:10,364 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:32:10,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:32:10,383 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:32:10,384 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:32:10,384 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:32:10,385 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:32:10,385 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:32:10,385 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:32:10,385 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:32:10,386 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:32:10,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:32:10,386 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:32:10,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:32:10,386 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:32:10,387 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:32:10,387 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:32:10,388 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:32:10,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:10,388 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:32:10,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:32:10,388 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:32:10,388 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:32:10,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:32:10,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:32:10,388 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:32:10,388 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:32:10,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:32:10,389 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:32:10,389 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7e15211580ea4e53f751b22847dfea4720c9dc42574c861d991d991eb47919b [2025-03-04 10:32:10,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:32:10,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:32:10,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:32:10,617 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:32:10,617 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:32:10,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c [2025-03-04 10:32:11,780 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d79f7f4/dd65c8b790cd4a108b471bed19bf206d/FLAG8e6d90fe7 [2025-03-04 10:32:11,979 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:32:11,979 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted-lit/HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c [2025-03-04 10:32:11,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d79f7f4/dd65c8b790cd4a108b471bed19bf206d/FLAG8e6d90fe7 [2025-03-04 10:32:12,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06d79f7f4/dd65c8b790cd4a108b471bed19bf206d [2025-03-04 10:32:12,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:32:12,043 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:32:12,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:12,045 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:32:12,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:32:12,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,049 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e6a11a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12, skipping insertion in model container [2025-03-04 10:32:12,049 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:32:12,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:12,158 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:32:12,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:32:12,179 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:32:12,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12 WrapperNode [2025-03-04 10:32:12,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:32:12,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:12,181 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:32:12,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:32:12,187 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,200 INFO L138 Inliner]: procedures = 6, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2025-03-04 10:32:12,201 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:32:12,202 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:32:12,202 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:32:12,202 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:32:12,208 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,209 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,216 INFO L175 MemorySlicer]: No memory access in input program. [2025-03-04 10:32:12,216 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,217 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,218 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,220 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,224 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:32:12,225 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:32:12,225 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:32:12,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:32:12,226 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (1/1) ... [2025-03-04 10:32:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:32:12,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:12,255 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:32:12,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:32:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure unlock [2025-03-04 10:32:12,283 INFO L138 BoogieDeclarations]: Found implementation of procedure unlock [2025-03-04 10:32:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure lock [2025-03-04 10:32:12,283 INFO L138 BoogieDeclarations]: Found implementation of procedure lock [2025-03-04 10:32:12,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:32:12,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:32:12,319 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:32:12,321 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:32:12,429 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-03-04 10:32:12,429 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:32:12,435 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:32:12,436 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:32:12,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:12 BoogieIcfgContainer [2025-03-04 10:32:12,436 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:32:12,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:32:12,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:32:12,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:32:12,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:32:12" (1/3) ... [2025-03-04 10:32:12,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbf1ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:12, skipping insertion in model container [2025-03-04 10:32:12,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:32:12" (2/3) ... [2025-03-04 10:32:12,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dbf1ed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:32:12, skipping insertion in model container [2025-03-04 10:32:12,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:32:12" (3/3) ... [2025-03-04 10:32:12,442 INFO L128 eAbstractionObserver]: Analyzing ICFG HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c [2025-03-04 10:32:12,451 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:32:12,452 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG HenzingerJhalaMajumdarSutre-POPL2002-LockingExample.c that has 3 procedures, 36 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-04 10:32:12,486 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:32:12,493 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@32326dc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:32:12,493 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:32:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 25 states have (on average 1.52) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:32:12,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:32:12,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:12,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:12,500 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:12,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1017778685, now seen corresponding path program 1 times [2025-03-04 10:32:12,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:12,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572737707] [2025-03-04 10:32:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:12,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:12,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:32:12,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:32:12,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:12,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:12,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572737707] [2025-03-04 10:32:12,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572737707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:12,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:12,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655568495] [2025-03-04 10:32:12,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:12,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:12,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:12,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:12,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:12,650 INFO L87 Difference]: Start difference. First operand has 36 states, 25 states have (on average 1.52) internal successors, (38), 29 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:12,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:12,687 INFO L93 Difference]: Finished difference Result 57 states and 74 transitions. [2025-03-04 10:32:12,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:12,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-04 10:32:12,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:12,694 INFO L225 Difference]: With dead ends: 57 [2025-03-04 10:32:12,694 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 10:32:12,696 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:12,697 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:12,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 10:32:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-03-04 10:32:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 24 states have internal predecessors, (31), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:32:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2025-03-04 10:32:12,719 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 11 [2025-03-04 10:32:12,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:12,720 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2025-03-04 10:32:12,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:12,720 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2025-03-04 10:32:12,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:32:12,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:12,722 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:12,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:32:12,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1486368164, now seen corresponding path program 1 times [2025-03-04 10:32:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604378168] [2025-03-04 10:32:12,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:12,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:32:12,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:32:12,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:12,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:12,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:12,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:12,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604378168] [2025-03-04 10:32:12,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604378168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:12,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:12,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:12,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040643906] [2025-03-04 10:32:12,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:12,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:12,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:12,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:12,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:12,769 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:12,789 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-03-04 10:32:12,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:12,789 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2025-03-04 10:32:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:12,789 INFO L225 Difference]: With dead ends: 31 [2025-03-04 10:32:12,789 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 10:32:12,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:12,790 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:12,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:12,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 10:32:12,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2025-03-04 10:32:12,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:32:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2025-03-04 10:32:12,794 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 12 [2025-03-04 10:32:12,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:12,794 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2025-03-04 10:32:12,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:32:12,794 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2025-03-04 10:32:12,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 10:32:12,795 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:12,795 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:32:12,795 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:12,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:12,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1956815421, now seen corresponding path program 1 times [2025-03-04 10:32:12,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:12,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768929372] [2025-03-04 10:32:12,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:12,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:12,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 10:32:12,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 10:32:12,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:12,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:12,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:12,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768929372] [2025-03-04 10:32:12,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768929372] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:12,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:12,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:12,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977417659] [2025-03-04 10:32:12,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:12,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:12,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:12,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:12,856 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:12,856 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:32:12,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:12,886 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-03-04 10:32:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2025-03-04 10:32:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:12,887 INFO L225 Difference]: With dead ends: 29 [2025-03-04 10:32:12,887 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 10:32:12,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:12,888 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:12,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 72 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:12,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 10:32:12,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 10:32:12,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 21 states have (on average 1.380952380952381) internal successors, (29), 22 states have internal predecessors, (29), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 10:32:12,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2025-03-04 10:32:12,896 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 15 [2025-03-04 10:32:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:12,896 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2025-03-04 10:32:12,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:32:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2025-03-04 10:32:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 10:32:12,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:12,897 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:12,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:32:12,897 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:12,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:12,898 INFO L85 PathProgramCache]: Analyzing trace with hash -531735925, now seen corresponding path program 1 times [2025-03-04 10:32:12,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:12,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149207743] [2025-03-04 10:32:12,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:12,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:12,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:32:12,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:32:12,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:12,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:32:12,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:12,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149207743] [2025-03-04 10:32:12,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149207743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:32:12,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:32:12,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:32:12,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347246696] [2025-03-04 10:32:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:32:12,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:32:12,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:12,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:32:12,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:12,951 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:32:12,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:12,978 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2025-03-04 10:32:12,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:32:12,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-03-04 10:32:12,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:12,981 INFO L225 Difference]: With dead ends: 37 [2025-03-04 10:32:12,981 INFO L226 Difference]: Without dead ends: 36 [2025-03-04 10:32:12,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:32:12,982 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 14 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:12,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 78 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:32:12,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2025-03-04 10:32:12,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2025-03-04 10:32:12,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 28 states have internal predecessors, (36), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:32:12,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2025-03-04 10:32:12,990 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 16 [2025-03-04 10:32:12,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:12,990 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2025-03-04 10:32:12,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:32:12,990 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2025-03-04 10:32:12,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 10:32:12,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:12,991 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:32:12,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:32:12,991 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:12,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:12,992 INFO L85 PathProgramCache]: Analyzing trace with hash -2063298061, now seen corresponding path program 1 times [2025-03-04 10:32:12,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:12,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959951631] [2025-03-04 10:32:12,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:12,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:13,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:32:13,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:32:13,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:13,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:32:13,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:13,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959951631] [2025-03-04 10:32:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959951631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:13,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512055950] [2025-03-04 10:32:13,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:32:13,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:13,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:13,098 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:13,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:32:13,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 10:32:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 10:32:13,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:32:13,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:13,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:32:13,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:32:13,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:32:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512055950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:13,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 10:32:13,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698811019] [2025-03-04 10:32:13,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:13,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:32:13,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:13,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:32:13,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:32:13,297 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:32:13,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:13,363 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2025-03-04 10:32:13,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:32:13,364 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 30 [2025-03-04 10:32:13,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:13,364 INFO L225 Difference]: With dead ends: 61 [2025-03-04 10:32:13,364 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 10:32:13,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 55 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-03-04 10:32:13,365 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 32 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:13,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 126 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 10:32:13,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 10:32:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 46 states have internal predecessors, (57), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 10:32:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2025-03-04 10:32:13,373 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 30 [2025-03-04 10:32:13,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:13,373 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2025-03-04 10:32:13,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 10 states have internal predecessors, (31), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:32:13,373 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2025-03-04 10:32:13,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:32:13,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:13,377 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1] [2025-03-04 10:32:13,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:32:13,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:13,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:13,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:13,579 INFO L85 PathProgramCache]: Analyzing trace with hash -183847893, now seen corresponding path program 2 times [2025-03-04 10:32:13,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:13,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577812241] [2025-03-04 10:32:13,579 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:13,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:13,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 10:32:13,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:32:13,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:13,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:13,822 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:32:13,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:13,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577812241] [2025-03-04 10:32:13,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577812241] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:13,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496046128] [2025-03-04 10:32:13,822 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:32:13,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:13,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:13,825 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:13,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:32:13,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 10:32:13,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:32:13,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:32:13,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:13,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:32:13,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:13,950 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:32:13,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:14,169 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:32:14,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496046128] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:14,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:14,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-04 10:32:14,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928077464] [2025-03-04 10:32:14,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:14,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:32:14,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:14,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:32:14,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:32:14,172 INFO L87 Difference]: Start difference. First operand 60 states and 81 transitions. Second operand has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 10 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 10:32:14,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:14,283 INFO L93 Difference]: Finished difference Result 109 states and 153 transitions. [2025-03-04 10:32:14,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 10:32:14,283 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 10 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) Word has length 72 [2025-03-04 10:32:14,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:14,284 INFO L225 Difference]: With dead ends: 109 [2025-03-04 10:32:14,284 INFO L226 Difference]: Without dead ends: 108 [2025-03-04 10:32:14,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:32:14,285 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 62 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:14,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 150 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:32:14,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-03-04 10:32:14,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2025-03-04 10:32:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 81 states have (on average 1.2222222222222223) internal successors, (99), 82 states have internal predecessors, (99), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:32:14,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 147 transitions. [2025-03-04 10:32:14,294 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 147 transitions. Word has length 72 [2025-03-04 10:32:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:14,295 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 147 transitions. [2025-03-04 10:32:14,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.1904761904761907) internal successors, (67), 22 states have internal predecessors, (67), 10 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 10 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-04 10:32:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 147 transitions. [2025-03-04 10:32:14,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 10:32:14,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:14,296 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1] [2025-03-04 10:32:14,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:14,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:32:14,501 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:14,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash 2011145883, now seen corresponding path program 3 times [2025-03-04 10:32:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:14,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253472224] [2025-03-04 10:32:14,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:14,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:14,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 11 equivalence classes. [2025-03-04 10:32:14,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 10:32:14,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:32:14,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,122 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 10:32:15,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:15,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253472224] [2025-03-04 10:32:15,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253472224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:15,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752479428] [2025-03-04 10:32:15,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:32:15,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:15,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:15,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:15,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:32:15,167 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 11 equivalence classes. [2025-03-04 10:32:15,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 10:32:15,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-04 10:32:15,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:15,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 10:32:15,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 10:32:15,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 430 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-04 10:32:15,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752479428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:15,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:15,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 45 [2025-03-04 10:32:15,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797849471] [2025-03-04 10:32:15,989 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:15,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-04 10:32:15,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:15,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-04 10:32:15,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:32:15,993 INFO L87 Difference]: Start difference. First operand 108 states and 147 transitions. Second operand has 46 states, 45 states have (on average 3.088888888888889) internal successors, (139), 46 states have internal predecessors, (139), 22 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-04 10:32:16,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:16,216 INFO L93 Difference]: Finished difference Result 205 states and 291 transitions. [2025-03-04 10:32:16,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 10:32:16,217 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.088888888888889) internal successors, (139), 46 states have internal predecessors, (139), 22 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) Word has length 156 [2025-03-04 10:32:16,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:16,219 INFO L225 Difference]: With dead ends: 205 [2025-03-04 10:32:16,219 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 10:32:16,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 541 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=551, Invalid=1519, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:32:16,220 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 83 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:16,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 216 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:32:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 10:32:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-04 10:32:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 153 states have (on average 1.196078431372549) internal successors, (183), 154 states have internal predecessors, (183), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-03-04 10:32:16,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 279 transitions. [2025-03-04 10:32:16,242 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 279 transitions. Word has length 156 [2025-03-04 10:32:16,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:16,243 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 279 transitions. [2025-03-04 10:32:16,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.088888888888889) internal successors, (139), 46 states have internal predecessors, (139), 22 states have call successors, (44), 1 states have call predecessors, (44), 1 states have return successors, (44), 22 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-04 10:32:16,243 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 279 transitions. [2025-03-04 10:32:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2025-03-04 10:32:16,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:16,247 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 1, 1, 1, 1] [2025-03-04 10:32:16,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:32:16,447 WARN L453 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-03-04 10:32:16,448 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:16,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:16,448 INFO L85 PathProgramCache]: Analyzing trace with hash 849232763, now seen corresponding path program 4 times [2025-03-04 10:32:16,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:16,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150579908] [2025-03-04 10:32:16,449 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:16,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:16,462 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 324 statements into 2 equivalence classes. [2025-03-04 10:32:16,478 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 324 of 324 statements. [2025-03-04 10:32:16,479 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:16,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 0 proven. 2068 refuted. 0 times theorem prover too weak. 1452 trivial. 0 not checked. [2025-03-04 10:32:18,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150579908] [2025-03-04 10:32:18,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150579908] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:18,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417969299] [2025-03-04 10:32:18,539 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 10:32:18,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:18,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:18,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:18,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:32:18,581 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 324 statements into 2 equivalence classes. [2025-03-04 10:32:18,644 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 324 of 324 statements. [2025-03-04 10:32:18,644 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 10:32:18,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:18,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-03-04 10:32:18,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:18,857 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-03-04 10:32:18,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:20,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3520 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 1518 trivial. 0 not checked. [2025-03-04 10:32:20,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417969299] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:20,654 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:20,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 47, 47] total 97 [2025-03-04 10:32:20,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305875639] [2025-03-04 10:32:20,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:20,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2025-03-04 10:32:20,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:20,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2025-03-04 10:32:20,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2310, Invalid=7196, Unknown=0, NotChecked=0, Total=9506 [2025-03-04 10:32:20,661 INFO L87 Difference]: Start difference. First operand 204 states and 279 transitions. Second operand has 98 states, 97 states have (on average 2.9690721649484537) internal successors, (288), 97 states have internal predecessors, (288), 47 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 46 states have call predecessors, (93), 47 states have call successors, (93) [2025-03-04 10:32:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:23,813 INFO L93 Difference]: Finished difference Result 1010 states and 1627 transitions. [2025-03-04 10:32:23,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2025-03-04 10:32:23,813 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 97 states have (on average 2.9690721649484537) internal successors, (288), 97 states have internal predecessors, (288), 47 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 46 states have call predecessors, (93), 47 states have call successors, (93) Word has length 324 [2025-03-04 10:32:23,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:23,820 INFO L225 Difference]: With dead ends: 1010 [2025-03-04 10:32:23,820 INFO L226 Difference]: Without dead ends: 809 [2025-03-04 10:32:23,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 791 GetRequests, 602 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9457 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6868, Invalid=29422, Unknown=0, NotChecked=0, Total=36290 [2025-03-04 10:32:23,828 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 628 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:23,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 408 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:32:23,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-04 10:32:23,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 792. [2025-03-04 10:32:23,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 593 states have (on average 1.178752107925801) internal successors, (699), 597 states have internal predecessors, (699), 192 states have call successors, (192), 4 states have call predecessors, (192), 6 states have return successors, (336), 192 states have call predecessors, (336), 192 states have call successors, (336) [2025-03-04 10:32:23,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1227 transitions. [2025-03-04 10:32:23,888 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1227 transitions. Word has length 324 [2025-03-04 10:32:23,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:23,889 INFO L471 AbstractCegarLoop]: Abstraction has 792 states and 1227 transitions. [2025-03-04 10:32:23,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 97 states have (on average 2.9690721649484537) internal successors, (288), 97 states have internal predecessors, (288), 47 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 46 states have call predecessors, (93), 47 states have call successors, (93) [2025-03-04 10:32:23,889 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1227 transitions. [2025-03-04 10:32:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 661 [2025-03-04 10:32:23,903 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:23,903 INFO L218 NwaCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 46, 46, 1, 1, 1, 1] [2025-03-04 10:32:23,910 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:32:24,108 WARN L453 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-03-04 10:32:24,108 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:24,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1761500475, now seen corresponding path program 5 times [2025-03-04 10:32:24,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:24,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315902715] [2025-03-04 10:32:24,109 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:32:24,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:24,123 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 660 statements into 47 equivalence classes. [2025-03-04 10:32:24,256 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 660 of 660 statements. [2025-03-04 10:32:24,256 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:32:24,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 15088 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 6486 trivial. 0 not checked. [2025-03-04 10:32:28,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:32:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315902715] [2025-03-04 10:32:28,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315902715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:32:28,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [919271164] [2025-03-04 10:32:28,909 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 10:32:28,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:32:28,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:32:28,911 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:32:28,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:32:28,967 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 660 statements into 47 equivalence classes. [2025-03-04 10:32:29,143 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) and asserted 660 of 660 statements. [2025-03-04 10:32:29,143 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2025-03-04 10:32:29,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:32:29,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1607 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-04 10:32:29,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:32:29,573 INFO L134 CoverageAnalysis]: Checked inductivity of 15088 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 6486 trivial. 0 not checked. [2025-03-04 10:32:29,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:32:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 15088 backedges. 0 proven. 8602 refuted. 0 times theorem prover too weak. 6486 trivial. 0 not checked. [2025-03-04 10:32:34,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [919271164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:32:34,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:32:34,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [95, 95, 95] total 189 [2025-03-04 10:32:34,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665751268] [2025-03-04 10:32:34,738 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:32:34,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 190 states [2025-03-04 10:32:34,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:32:34,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2025-03-04 10:32:34,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9119, Invalid=26791, Unknown=0, NotChecked=0, Total=35910 [2025-03-04 10:32:34,749 INFO L87 Difference]: Start difference. First operand 792 states and 1227 transitions. Second operand has 190 states, 189 states have (on average 3.0211640211640214) internal successors, (571), 190 states have internal predecessors, (571), 94 states have call successors, (188), 1 states have call predecessors, (188), 1 states have return successors, (188), 94 states have call predecessors, (188), 94 states have call successors, (188) [2025-03-04 10:32:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:32:35,868 INFO L93 Difference]: Finished difference Result 1561 states and 2523 transitions. [2025-03-04 10:32:35,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-03-04 10:32:35,869 INFO L78 Accepts]: Start accepts. Automaton has has 190 states, 189 states have (on average 3.0211640211640214) internal successors, (571), 190 states have internal predecessors, (571), 94 states have call successors, (188), 1 states have call predecessors, (188), 1 states have return successors, (188), 94 states have call predecessors, (188), 94 states have call successors, (188) Word has length 660 [2025-03-04 10:32:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:32:35,878 INFO L225 Difference]: With dead ends: 1561 [2025-03-04 10:32:35,878 INFO L226 Difference]: Without dead ends: 1560 [2025-03-04 10:32:35,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1413 GetRequests, 1225 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-03-04 10:32:35,881 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 386 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:32:35,881 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 570 Invalid, 726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:32:35,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-03-04 10:32:35,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2025-03-04 10:32:35,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1169 states have (on average 1.172797262617622) internal successors, (1371), 1173 states have internal predecessors, (1371), 384 states have call successors, (384), 4 states have call predecessors, (384), 6 states have return successors, (672), 384 states have call predecessors, (672), 384 states have call successors, (672) [2025-03-04 10:32:35,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2427 transitions. [2025-03-04 10:32:35,941 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2427 transitions. Word has length 660 [2025-03-04 10:32:35,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:32:35,944 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2427 transitions. [2025-03-04 10:32:35,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 190 states, 189 states have (on average 3.0211640211640214) internal successors, (571), 190 states have internal predecessors, (571), 94 states have call successors, (188), 1 states have call predecessors, (188), 1 states have return successors, (188), 94 states have call predecessors, (188), 94 states have call successors, (188) [2025-03-04 10:32:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2427 transitions. [2025-03-04 10:32:35,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1333 [2025-03-04 10:32:35,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:32:35,982 INFO L218 NwaCegarLoop]: trace histogram [95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 95, 94, 94, 1, 1, 1, 1] [2025-03-04 10:32:35,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 10:32:36,182 WARN L453 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-03-04 10:32:36,183 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:32:36,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:32:36,183 INFO L85 PathProgramCache]: Analyzing trace with hash 231346363, now seen corresponding path program 6 times [2025-03-04 10:32:36,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:32:36,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385541685] [2025-03-04 10:32:36,184 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:32:36,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:32:36,208 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1332 statements into 95 equivalence classes. [2025-03-04 10:32:36,544 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 1332 of 1332 statements. [2025-03-04 10:32:36,544 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:32:36,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,181 INFO L134 CoverageAnalysis]: Checked inductivity of 62416 backedges. 0 proven. 35626 refuted. 0 times theorem prover too weak. 26790 trivial. 0 not checked. [2025-03-04 10:33:00,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:33:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385541685] [2025-03-04 10:33:00,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385541685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:33:00,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809674751] [2025-03-04 10:33:00,182 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 10:33:00,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:33:00,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:33:00,184 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:33:00,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:33:00,278 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 1332 statements into 95 equivalence classes. [2025-03-04 10:33:00,726 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) and asserted 1332 of 1332 statements. [2025-03-04 10:33:00,727 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2025-03-04 10:33:00,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:33:00,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 3239 conjuncts, 191 conjuncts are in the unsatisfiable core [2025-03-04 10:33:00,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:33:01,414 INFO L134 CoverageAnalysis]: Checked inductivity of 62416 backedges. 0 proven. 35626 refuted. 0 times theorem prover too weak. 26790 trivial. 0 not checked. [2025-03-04 10:33:01,414 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:33:20,634 INFO L134 CoverageAnalysis]: Checked inductivity of 62416 backedges. 0 proven. 35626 refuted. 0 times theorem prover too weak. 26790 trivial. 0 not checked. [2025-03-04 10:33:20,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809674751] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:33:20,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:33:20,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [192, 191, 191] total 383 [2025-03-04 10:33:20,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827181037] [2025-03-04 10:33:20,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:33:20,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 384 states [2025-03-04 10:33:20,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:33:20,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 384 interpolants. [2025-03-04 10:33:20,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36917, Invalid=110155, Unknown=0, NotChecked=0, Total=147072 [2025-03-04 10:33:20,653 INFO L87 Difference]: Start difference. First operand 1560 states and 2427 transitions. Second operand has 384 states, 383 states have (on average 3.0078328981723237) internal successors, (1152), 384 states have internal predecessors, (1152), 191 states have call successors, (381), 1 states have call predecessors, (381), 1 states have return successors, (381), 191 states have call predecessors, (381), 191 states have call successors, (381) [2025-03-04 10:33:33,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:33:33,586 INFO L93 Difference]: Finished difference Result 4771 states and 7547 transitions. [2025-03-04 10:33:33,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 452 states. [2025-03-04 10:33:33,588 INFO L78 Accepts]: Start accepts. Automaton has has 384 states, 383 states have (on average 3.0078328981723237) internal successors, (1152), 384 states have internal predecessors, (1152), 191 states have call successors, (381), 1 states have call predecessors, (381), 1 states have return successors, (381), 191 states have call predecessors, (381), 191 states have call successors, (381) Word has length 1332 [2025-03-04 10:33:33,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:33:33,604 INFO L225 Difference]: With dead ends: 4771 [2025-03-04 10:33:33,605 INFO L226 Difference]: Without dead ends: 3094 [2025-03-04 10:33:33,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2992 GetRequests, 2472 SyntacticMatches, 0 SemanticMatches, 520 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68089 ImplicationChecksByTransitivity, 32.0s TimeCoverageRelationStatistics Valid=63551, Invalid=208411, Unknown=0, NotChecked=0, Total=271962 [2025-03-04 10:33:33,618 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 874 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 1380 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 876 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:33:33,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [876 Valid, 663 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1380 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 10:33:33,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3094 states. [2025-03-04 10:33:33,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3094 to 3094. [2025-03-04 10:33:33,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3094 states, 2319 states have (on average 1.1095299698145753) internal successors, (2573), 2323 states have internal predecessors, (2573), 768 states have call successors, (768), 4 states have call predecessors, (768), 6 states have return successors, (1344), 768 states have call predecessors, (1344), 768 states have call successors, (1344) [2025-03-04 10:33:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3094 states to 3094 states and 4685 transitions. [2025-03-04 10:33:33,718 INFO L78 Accepts]: Start accepts. Automaton has 3094 states and 4685 transitions. Word has length 1332 [2025-03-04 10:33:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:33:33,720 INFO L471 AbstractCegarLoop]: Abstraction has 3094 states and 4685 transitions. [2025-03-04 10:33:33,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 384 states, 383 states have (on average 3.0078328981723237) internal successors, (1152), 384 states have internal predecessors, (1152), 191 states have call successors, (381), 1 states have call predecessors, (381), 1 states have return successors, (381), 191 states have call predecessors, (381), 191 states have call successors, (381) [2025-03-04 10:33:33,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3094 states and 4685 transitions. [2025-03-04 10:33:33,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2677 [2025-03-04 10:33:33,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:33:33,760 INFO L218 NwaCegarLoop]: trace histogram [191, 191, 191, 191, 191, 191, 191, 191, 191, 191, 191, 191, 190, 190, 1, 1, 1, 1] [2025-03-04 10:33:33,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 10:33:33,960 WARN L453 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-03-04 10:33:33,961 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:33:33,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:33:33,962 INFO L85 PathProgramCache]: Analyzing trace with hash -611354693, now seen corresponding path program 7 times [2025-03-04 10:33:33,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:33:33,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754204504] [2025-03-04 10:33:33,962 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 10:33:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:33:34,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2676 statements into 1 equivalence classes. [2025-03-04 10:33:34,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2676 of 2676 statements. [2025-03-04 10:33:34,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:33:34,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat