./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/nla-digbench-scaling/dijkstra-u_unwindbound10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:55:06,329 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:55:06,380 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:55:06,383 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:55:06,383 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:55:06,408 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:55:06,409 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:55:06,409 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:55:06,409 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:55:06,410 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:55:06,410 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:55:06,410 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:55:06,411 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:55:06,411 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:55:06,411 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:55:06,411 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:55:06,411 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:55:06,411 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:55:06,411 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:55:06,412 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:55:06,412 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:55:06,413 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:55:06,413 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:55:06,413 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:55:06,413 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:55:06,413 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:55:06,413 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:55:06,413 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:55:06,413 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:55:06,414 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:55:06,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:55:06,414 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:55:06,414 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:55:06,414 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:55:06,414 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:55:06,414 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 26517bdd67184dea6352cf50b6d9992d41ecfd853675bfc685354b90b7b5bf40 [2025-03-04 10:55:06,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:55:06,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:55:06,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:55:06,654 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:55:06,654 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:55:06,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2025-03-04 10:55:07,804 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf95da7d1/68b12bc986db42c58d40d4fe6777781c/FLAG4277383dc [2025-03-04 10:55:08,011 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:55:08,011 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/dijkstra-u_unwindbound10.c [2025-03-04 10:55:08,020 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf95da7d1/68b12bc986db42c58d40d4fe6777781c/FLAG4277383dc [2025-03-04 10:55:08,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf95da7d1/68b12bc986db42c58d40d4fe6777781c [2025-03-04 10:55:08,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:55:08,378 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:55:08,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:55:08,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:55:08,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:55:08,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c4df92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08, skipping insertion in model container [2025-03-04 10:55:08,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,395 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:55:08,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:55:08,496 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:55:08,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:55:08,520 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:55:08,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08 WrapperNode [2025-03-04 10:55:08,521 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:55:08,522 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:55:08,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:55:08,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:55:08,526 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:55:08" (1/1) ... [2025-03-04 10:55:08,530 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:55:08" (1/1) ... [2025-03-04 10:55:08,540 INFO L138 Inliner]: procedures = 14, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 72 [2025-03-04 10:55:08,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:55:08,541 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:55:08,541 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:55:08,541 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:55:08,547 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,548 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,555 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:55:08,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,557 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,557 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,558 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,559 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:55:08,560 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:55:08,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:55:08,560 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:55:08,560 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (1/1) ... [2025-03-04 10:55:08,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:55:08,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:08,581 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:55:08,583 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:55:08,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:55:08,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:55:08,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:55:08,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:55:08,598 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:55:08,598 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:55:08,631 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:55:08,633 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:55:08,781 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 10:55:08,781 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:55:08,787 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:55:08,787 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:55:08,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:55:08 BoogieIcfgContainer [2025-03-04 10:55:08,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:55:08,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:55:08,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:55:08,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:55:08,792 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:55:08" (1/3) ... [2025-03-04 10:55:08,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c0c776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:55:08, skipping insertion in model container [2025-03-04 10:55:08,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:55:08" (2/3) ... [2025-03-04 10:55:08,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67c0c776 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:55:08, skipping insertion in model container [2025-03-04 10:55:08,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:55:08" (3/3) ... [2025-03-04 10:55:08,794 INFO L128 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound10.c [2025-03-04 10:55:08,803 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:55:08,804 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dijkstra-u_unwindbound10.c that has 2 procedures, 38 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-04 10:55:08,839 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:55:08,849 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;@1e83654a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:55:08,850 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 10:55:08,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:55:08,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:55:08,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:08,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:55:08,856 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:55:08,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2128991902, now seen corresponding path program 1 times [2025-03-04 10:55:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:08,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872504274] [2025-03-04 10:55:08,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:08,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:08,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:55:08,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:55:08,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:08,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:08,948 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:55:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872504274] [2025-03-04 10:55:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872504274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:08,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:08,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:55:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101941053] [2025-03-04 10:55:08,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:08,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:55:08,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:08,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:55:08,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:55:08,968 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.565217391304348) internal successors, (36), 27 states have internal predecessors, (36), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:08,984 INFO L93 Difference]: Finished difference Result 72 states and 112 transitions. [2025-03-04 10:55:08,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:55:08,985 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:55:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:08,989 INFO L225 Difference]: With dead ends: 72 [2025-03-04 10:55:08,989 INFO L226 Difference]: Without dead ends: 29 [2025-03-04 10:55:08,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:55:08,995 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:08,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-04 10:55:09,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-03-04 10:55:09,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:55:09,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2025-03-04 10:55:09,024 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 6 [2025-03-04 10:55:09,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:09,024 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2025-03-04 10:55:09,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,024 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2025-03-04 10:55:09,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 10:55:09,027 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:09,027 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 10:55:09,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:55:09,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:09,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash 2129021693, now seen corresponding path program 1 times [2025-03-04 10:55:09,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:09,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274185120] [2025-03-04 10:55:09,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:09,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 10:55:09,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 10:55:09,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:09,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:09,119 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:55:09,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:09,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274185120] [2025-03-04 10:55:09,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274185120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:09,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:09,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:55:09,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919205031] [2025-03-04 10:55:09,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:09,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:55:09,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:09,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:55:09,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:55:09,123 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:09,165 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2025-03-04 10:55:09,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:55:09,166 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 10:55:09,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:09,166 INFO L225 Difference]: With dead ends: 34 [2025-03-04 10:55:09,166 INFO L226 Difference]: Without dead ends: 33 [2025-03-04 10:55:09,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:55:09,167 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 13 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 79 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:55:09,168 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 79 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-04 10:55:09,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2025-03-04 10:55:09,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 20 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:55:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-03-04 10:55:09,172 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 6 [2025-03-04 10:55:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:09,172 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-03-04 10:55:09,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,173 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-03-04 10:55:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:55:09,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:09,173 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:09,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:55:09,173 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:09,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:09,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1575163045, now seen corresponding path program 1 times [2025-03-04 10:55:09,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:09,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832739720] [2025-03-04 10:55:09,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:09,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:55:09,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:55:09,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:09,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:09,234 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:55:09,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:09,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832739720] [2025-03-04 10:55:09,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832739720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:09,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:09,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:55:09,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520139328] [2025-03-04 10:55:09,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:09,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:55:09,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:09,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:55:09,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:55:09,236 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:09,270 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2025-03-04 10:55:09,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:55:09,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:55:09,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:09,271 INFO L225 Difference]: With dead ends: 51 [2025-03-04 10:55:09,271 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:55:09,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:55:09,271 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:09,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 88 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:09,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:55:09,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 10:55:09,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:55:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2025-03-04 10:55:09,275 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 7 [2025-03-04 10:55:09,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:09,276 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2025-03-04 10:55:09,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,276 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2025-03-04 10:55:09,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:55:09,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:09,276 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:09,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:55:09,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:09,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:09,279 INFO L85 PathProgramCache]: Analyzing trace with hash -682742240, now seen corresponding path program 1 times [2025-03-04 10:55:09,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:09,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099304337] [2025-03-04 10:55:09,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:09,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:09,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:55:09,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:55:09,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:09,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:09,349 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:55:09,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:09,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099304337] [2025-03-04 10:55:09,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099304337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:09,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:09,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:55:09,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772950438] [2025-03-04 10:55:09,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:09,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:55:09,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:09,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:55:09,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:55:09,351 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:09,414 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2025-03-04 10:55:09,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:55:09,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 10:55:09,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:09,417 INFO L225 Difference]: With dead ends: 32 [2025-03-04 10:55:09,417 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 10:55:09,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:55:09,417 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 32 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:09,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 73 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:09,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 10:55:09,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 10:55:09,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 23 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:55:09,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2025-03-04 10:55:09,421 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 11 [2025-03-04 10:55:09,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:09,423 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2025-03-04 10:55:09,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,423 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2025-03-04 10:55:09,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:55:09,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:09,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:09,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:55:09,424 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:55:09,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash 309827030, now seen corresponding path program 1 times [2025-03-04 10:55:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:09,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316066970] [2025-03-04 10:55:09,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:09,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:09,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:55:09,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:55:09,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:09,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:09,536 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:55:09,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:09,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316066970] [2025-03-04 10:55:09,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316066970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:09,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:09,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:55:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675863222] [2025-03-04 10:55:09,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:09,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:55:09,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:09,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:55:09,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:55:09,538 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:09,584 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2025-03-04 10:55:09,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:55:09,585 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:55:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:09,585 INFO L225 Difference]: With dead ends: 41 [2025-03-04 10:55:09,585 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 10:55:09,586 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:55:09,586 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 12 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:09,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 106 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 10:55:09,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2025-03-04 10:55:09,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:55:09,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2025-03-04 10:55:09,590 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 12 [2025-03-04 10:55:09,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:09,590 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2025-03-04 10:55:09,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2025-03-04 10:55:09,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 10:55:09,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:09,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:09,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:55:09,591 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:09,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:09,591 INFO L85 PathProgramCache]: Analyzing trace with hash 309898528, now seen corresponding path program 1 times [2025-03-04 10:55:09,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:09,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612420211] [2025-03-04 10:55:09,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:09,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:09,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:55:09,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:55:09,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:09,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:09,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:09,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612420211] [2025-03-04 10:55:09,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612420211] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:09,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869384441] [2025-03-04 10:55:09,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:09,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:09,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:09,670 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:55:09,671 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:55:09,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 10:55:09,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 10:55:09,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:09,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:09,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:55:09,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:09,735 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:09,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:09,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869384441] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:09,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:09,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:55:09,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766134627] [2025-03-04 10:55:09,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:09,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:55:09,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:09,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:55:09,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:55:09,785 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:09,893 INFO L93 Difference]: Finished difference Result 74 states and 95 transitions. [2025-03-04 10:55:09,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:55:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-03-04 10:55:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:09,896 INFO L225 Difference]: With dead ends: 74 [2025-03-04 10:55:09,896 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 10:55:09,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:55:09,897 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:09,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 140 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:09,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 10:55:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2025-03-04 10:55:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 40 states have internal predecessors, (48), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:55:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2025-03-04 10:55:09,902 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 12 [2025-03-04 10:55:09,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:09,902 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-03-04 10:55:09,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2025-03-04 10:55:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 10:55:09,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:09,902 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:09,908 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:55:10,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 10:55:10,108 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:55:10,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash 629477947, now seen corresponding path program 1 times [2025-03-04 10:55:10,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:10,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954748510] [2025-03-04 10:55:10,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:10,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:10,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:55:10,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:55:10,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:10,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954748510] [2025-03-04 10:55:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954748510] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:10,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422613960] [2025-03-04 10:55:10,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:10,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:10,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:10,196 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:55:10,197 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:55:10,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 10:55:10,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 10:55:10,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:10,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:10,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:55:10,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:10,270 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:10,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:10,342 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:10,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422613960] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:10,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:10,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:55:10,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073232229] [2025-03-04 10:55:10,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:10,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:55:10,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:10,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:55:10,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:55:10,344 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:14,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:55:14,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:14,620 INFO L93 Difference]: Finished difference Result 80 states and 103 transitions. [2025-03-04 10:55:14,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 10:55:14,623 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 10:55:14,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:14,624 INFO L225 Difference]: With dead ends: 80 [2025-03-04 10:55:14,624 INFO L226 Difference]: Without dead ends: 79 [2025-03-04 10:55:14,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=194, Invalid=562, Unknown=0, NotChecked=0, Total=756 [2025-03-04 10:55:14,625 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:14,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 172 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 10:55:14,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-04 10:55:14,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 66. [2025-03-04 10:55:14,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 50 states have (on average 1.24) internal successors, (62), 51 states have internal predecessors, (62), 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:55:14,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 86 transitions. [2025-03-04 10:55:14,635 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 86 transitions. Word has length 17 [2025-03-04 10:55:14,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:14,635 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 86 transitions. [2025-03-04 10:55:14,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:14,635 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 86 transitions. [2025-03-04 10:55:14,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-04 10:55:14,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:14,636 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 10:55:14,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:55:14,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 10:55:14,837 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:14,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:14,837 INFO L85 PathProgramCache]: Analyzing trace with hash 595371621, now seen corresponding path program 2 times [2025-03-04 10:55:14,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:14,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881071969] [2025-03-04 10:55:14,838 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:55:14,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:14,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 10:55:14,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 10:55:14,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:55:14,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:14,932 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:55:14,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:14,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881071969] [2025-03-04 10:55:14,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1881071969] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:14,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:14,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:55:14,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74354006] [2025-03-04 10:55:14,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:14,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:55:14,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:14,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:55:14,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:55:14,933 INFO L87 Difference]: Start difference. First operand 66 states and 86 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:14,971 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2025-03-04 10:55:14,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:55:14,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-04 10:55:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:14,973 INFO L225 Difference]: With dead ends: 73 [2025-03-04 10:55:14,973 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 10:55:14,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:55:14,974 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 10 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:14,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 104 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 10:55:14,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2025-03-04 10:55:14,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 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:55:14,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 85 transitions. [2025-03-04 10:55:14,984 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 85 transitions. Word has length 27 [2025-03-04 10:55:14,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:14,984 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 85 transitions. [2025-03-04 10:55:14,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2025-03-04 10:55:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 10:55:14,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:14,987 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:14,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:55:14,988 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:55:14,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:14,988 INFO L85 PathProgramCache]: Analyzing trace with hash 776554684, now seen corresponding path program 1 times [2025-03-04 10:55:14,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:14,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290098361] [2025-03-04 10:55:14,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:14,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:14,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:55:14,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:55:14,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:14,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:15,124 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:15,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290098361] [2025-03-04 10:55:15,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290098361] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:15,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [251564489] [2025-03-04 10:55:15,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:15,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:15,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:15,127 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:55:15,129 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:55:15,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 10:55:15,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 10:55:15,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:15,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:15,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:55:15,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:15,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:15,369 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:15,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [251564489] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:15,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2025-03-04 10:55:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959699024] [2025-03-04 10:55:15,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:15,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:55:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:15,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:55:15,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=331, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:55:15,370 INFO L87 Difference]: Start difference. First operand 65 states and 85 transitions. Second operand has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:15,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:15,706 INFO L93 Difference]: Finished difference Result 143 states and 180 transitions. [2025-03-04 10:55:15,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-03-04 10:55:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 10:55:15,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:15,709 INFO L225 Difference]: With dead ends: 143 [2025-03-04 10:55:15,709 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 10:55:15,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=549, Invalid=1091, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 10:55:15,712 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 135 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:15,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 222 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:55:15,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 10:55:15,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2025-03-04 10:55:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 79 states have internal predecessors, (93), 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:55:15,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2025-03-04 10:55:15,721 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 31 [2025-03-04 10:55:15,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:15,721 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2025-03-04 10:55:15,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.6818181818181817) internal successors, (59), 21 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:15,721 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2025-03-04 10:55:15,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:55:15,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:15,722 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:15,728 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:55:15,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:15,922 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:55:15,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:15,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1697440746, now seen corresponding path program 2 times [2025-03-04 10:55:15,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:15,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383752972] [2025-03-04 10:55:15,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:55:15,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:15,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-03-04 10:55:15,930 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 32 statements. [2025-03-04 10:55:15,930 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:55:15,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-03-04 10:55:15,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383752972] [2025-03-04 10:55:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383752972] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:15,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:15,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:55:15,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549741802] [2025-03-04 10:55:15,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:15,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:55:15,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:15,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:55:15,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:55:15,962 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:16,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:16,003 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2025-03-04 10:55:16,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:55:16,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-04 10:55:16,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:16,005 INFO L225 Difference]: With dead ends: 102 [2025-03-04 10:55:16,005 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 10:55:16,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:55:16,006 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:16,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 91 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:16,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 10:55:16,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2025-03-04 10:55:16,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 79 states have (on average 1.1772151898734178) internal successors, (93), 79 states have internal predecessors, (93), 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:55:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 117 transitions. [2025-03-04 10:55:16,016 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 117 transitions. Word has length 32 [2025-03-04 10:55:16,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:16,017 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 117 transitions. [2025-03-04 10:55:16,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:16,017 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 117 transitions. [2025-03-04 10:55:16,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:55:16,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:16,018 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:16,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:55:16,018 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:55:16,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:16,019 INFO L85 PathProgramCache]: Analyzing trace with hash 200229035, now seen corresponding path program 1 times [2025-03-04 10:55:16,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:16,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963953913] [2025-03-04 10:55:16,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:16,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:16,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:55:16,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:55:16,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:16,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:16,189 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:55:16,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:16,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963953913] [2025-03-04 10:55:16,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963953913] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:16,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1266657772] [2025-03-04 10:55:16,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:55:16,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:16,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:16,191 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:55:16,193 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:55:16,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:55:16,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:55:16,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:55:16,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:16,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:55:16,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:55:16,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:16,496 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:55:16,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1266657772] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:16,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 21 [2025-03-04 10:55:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018732001] [2025-03-04 10:55:16,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:16,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:55:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:16,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:55:16,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:55:16,498 INFO L87 Difference]: Start difference. First operand 94 states and 117 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 10:55:21,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-04 10:55:21,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:21,337 INFO L93 Difference]: Finished difference Result 161 states and 204 transitions. [2025-03-04 10:55:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-04 10:55:21,338 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 58 [2025-03-04 10:55:21,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:21,339 INFO L225 Difference]: With dead ends: 161 [2025-03-04 10:55:21,339 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 10:55:21,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=493, Invalid=1577, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 10:55:21,340 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 136 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 28 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:21,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 216 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 186 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 10:55:21,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 10:55:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 126. [2025-03-04 10:55:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 97 states have internal predecessors, (113), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:55:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 161 transitions. [2025-03-04 10:55:21,363 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 161 transitions. Word has length 58 [2025-03-04 10:55:21,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:21,363 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 161 transitions. [2025-03-04 10:55:21,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 22 states have internal predecessors, (62), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-04 10:55:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 161 transitions. [2025-03-04 10:55:21,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:55:21,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:21,367 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:21,373 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:55:21,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:21,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:21,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:21,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1941495644, now seen corresponding path program 2 times [2025-03-04 10:55:21,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:21,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902688464] [2025-03-04 10:55:21,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:55:21,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:21,574 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-04 10:55:21,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:55:21,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:55:21,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:22,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902688464] [2025-03-04 10:55:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902688464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1445464015] [2025-03-04 10:55:22,086 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:55:22,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:22,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:22,088 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:55:22,089 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:55:22,109 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-03-04 10:55:22,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:55:22,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:55:22,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:22,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 10:55:22,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:22,250 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:23,014 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:55:23,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1445464015] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:23,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:23,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 49 [2025-03-04 10:55:23,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928626338] [2025-03-04 10:55:23,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:23,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 10:55:23,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:23,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 10:55:23,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=1916, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 10:55:23,019 INFO L87 Difference]: Start difference. First operand 126 states and 161 transitions. Second operand has 51 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:24,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:24,674 INFO L93 Difference]: Finished difference Result 322 states and 406 transitions. [2025-03-04 10:55:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-04 10:55:24,675 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2025-03-04 10:55:24,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:24,676 INFO L225 Difference]: With dead ends: 322 [2025-03-04 10:55:24,676 INFO L226 Difference]: Without dead ends: 321 [2025-03-04 10:55:24,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3785 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3289, Invalid=10517, Unknown=0, NotChecked=0, Total=13806 [2025-03-04 10:55:24,680 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 486 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:24,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 245 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:55:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2025-03-04 10:55:24,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 186. [2025-03-04 10:55:24,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 157 states have (on average 1.2547770700636942) internal successors, (197), 157 states have internal predecessors, (197), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-04 10:55:24,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 245 transitions. [2025-03-04 10:55:24,689 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 245 transitions. Word has length 61 [2025-03-04 10:55:24,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:24,689 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 245 transitions. [2025-03-04 10:55:24,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.48) internal successors, (124), 50 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:24,690 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 245 transitions. [2025-03-04 10:55:24,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 10:55:24,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:24,691 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:24,697 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:55:24,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 10:55:24,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:24,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:24,895 INFO L85 PathProgramCache]: Analyzing trace with hash -911318267, now seen corresponding path program 2 times [2025-03-04 10:55:24,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:24,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756889112] [2025-03-04 10:55:24,895 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:55:24,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:24,902 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-03-04 10:55:24,912 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 10:55:24,912 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:55:24,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:25,014 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 10:55:25,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:25,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756889112] [2025-03-04 10:55:25,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756889112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:55:25,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:55:25,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:55:25,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179283066] [2025-03-04 10:55:25,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:55:25,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:55:25,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:25,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:55:25,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:55:25,016 INFO L87 Difference]: Start difference. First operand 186 states and 245 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:55:25,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:25,097 INFO L93 Difference]: Finished difference Result 198 states and 257 transitions. [2025-03-04 10:55:25,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:55:25,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-03-04 10:55:25,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:25,099 INFO L225 Difference]: With dead ends: 198 [2025-03-04 10:55:25,099 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 10:55:25,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:55:25,100 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 18 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:25,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 79 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:55:25,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 10:55:25,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-03-04 10:55:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.0082644628099173) internal successors, (122), 121 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2025-03-04 10:55:25,105 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 99 [2025-03-04 10:55:25,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:25,105 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2025-03-04 10:55:25,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:55:25,105 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2025-03-04 10:55:25,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-04 10:55:25,106 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:55:25,106 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:55:25,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:55:25,106 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2025-03-04 10:55:25,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:55:25,107 INFO L85 PathProgramCache]: Analyzing trace with hash 372901020, now seen corresponding path program 3 times [2025-03-04 10:55:25,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:55:25,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166654724] [2025-03-04 10:55:25,107 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:55:25,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:55:25,114 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 23 equivalence classes. [2025-03-04 10:55:25,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 121 statements. [2025-03-04 10:55:25,118 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:55:25,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:25,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 129 proven. 1 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2025-03-04 10:55:25,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:55:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166654724] [2025-03-04 10:55:25,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166654724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:55:25,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142653654] [2025-03-04 10:55:25,169 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:55:25,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:25,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:55:25,171 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:55:25,173 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:55:25,198 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 121 statements into 23 equivalence classes. [2025-03-04 10:55:25,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 121 statements. [2025-03-04 10:55:25,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:55:25,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:55:25,205 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:55:25,207 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:55:25,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 129 proven. 1 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2025-03-04 10:55:25,237 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:55:25,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1243 backedges. 129 proven. 1 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2025-03-04 10:55:25,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142653654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:55:25,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:55:25,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 10:55:25,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892332355] [2025-03-04 10:55:25,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:55:25,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:55:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:55:25,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:55:25,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:55:25,306 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:55:25,360 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2025-03-04 10:55:25,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:55:25,361 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2025-03-04 10:55:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:55:25,361 INFO L225 Difference]: With dead ends: 122 [2025-03-04 10:55:25,361 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:55:25,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:55:25,363 INFO L435 NwaCegarLoop]: 5 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:55:25,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 24 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:55:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:55:25,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:55:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:55:25,364 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2025-03-04 10:55:25,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:55:25,364 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:55:25,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:55:25,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:55:25,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:55:25,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2025-03-04 10:55:25,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2025-03-04 10:55:25,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2025-03-04 10:55:25,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2025-03-04 10:55:25,373 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:55:25,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:55:25,570 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:55:25,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:55:27,147 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:55:27,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:55:27 BoogieIcfgContainer [2025-03-04 10:55:27,158 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:55:27,159 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:55:27,159 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:55:27,159 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:55:27,159 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:55:08" (3/4) ... [2025-03-04 10:55:27,160 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:55:27,164 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:55:27,166 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-04 10:55:27,166 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:55:27,166 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:55:27,166 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:55:27,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:55:27,223 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:55:27,223 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:55:27,224 INFO L158 Benchmark]: Toolchain (without parser) took 18845.85ms. Allocated memory was 142.6MB in the beginning and 461.4MB in the end (delta: 318.8MB). Free memory was 113.7MB in the beginning and 178.0MB in the end (delta: -64.4MB). Peak memory consumption was 252.4MB. Max. memory is 16.1GB. [2025-03-04 10:55:27,224 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:55:27,224 INFO L158 Benchmark]: CACSL2BoogieTranslator took 142.73ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 101.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:55:27,224 INFO L158 Benchmark]: Boogie Procedure Inliner took 18.99ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:55:27,224 INFO L158 Benchmark]: Boogie Preprocessor took 18.07ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:55:27,224 INFO L158 Benchmark]: IcfgBuilder took 227.87ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 83.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:55:27,225 INFO L158 Benchmark]: TraceAbstraction took 18369.06ms. Allocated memory was 142.6MB in the beginning and 461.4MB in the end (delta: 318.8MB). Free memory was 83.2MB in the beginning and 186.1MB in the end (delta: -102.9MB). Peak memory consumption was 244.9MB. Max. memory is 16.1GB. [2025-03-04 10:55:27,225 INFO L158 Benchmark]: Witness Printer took 64.56ms. Allocated memory is still 461.4MB. Free memory was 186.1MB in the beginning and 178.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:55:27,226 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.53ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 142.73ms. Allocated memory is still 142.6MB. Free memory was 113.7MB in the beginning and 101.8MB in the end (delta: 11.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 18.99ms. Allocated memory is still 142.6MB. Free memory was 101.8MB in the beginning and 100.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.07ms. Allocated memory is still 142.6MB. Free memory was 100.3MB in the beginning and 99.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 227.87ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 83.7MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18369.06ms. Allocated memory was 142.6MB in the beginning and 461.4MB in the end (delta: 318.8MB). Free memory was 83.2MB in the beginning and 186.1MB in the end (delta: -102.9MB). Peak memory consumption was 244.9MB. Max. memory is 16.1GB. * Witness Printer took 64.56ms. Allocated memory is still 461.4MB. Free memory was 186.1MB in the beginning and 178.0MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 16.7s, OverallIterations: 14, TraceHistogramMax: 23, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 11.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 973 SdHoareTripleChecker+Valid, 9.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 973 mSDsluCounter, 1688 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1301 mSDsCounter, 79 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1032 IncrementalHoareTripleChecker+Invalid, 1113 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 79 mSolverCounterUnsat, 387 mSDtfsCounter, 1032 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 825 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4710 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186occurred in iteration=12, InterpolantAutomatonStates: 252, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 243 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 800 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1074 ConstructedInterpolants, 0 QuantifiedInterpolants, 2186 SizeOfPredicates, 52 NumberOfNonLiveVariables, 540 ConjunctsInSsa, 65 ConjunctsInUnsatCore, 26 InterpolantComputations, 8 PerfectInterpolantSequences, 4310/5324 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 30]: Location Invariant Derived location invariant: (((counter <= 10) && (1 <= counter)) || (counter == 0)) - InvariantResult [Line: 20]: Location Invariant Derived location invariant: ((1 <= counter) && (counter <= 2147483646)) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:55:27,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE