./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.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/fermat1-ll_unwindbound2.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 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:01:03,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:01:03,645 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:01:03,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:01:03,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:01:03,671 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:01:03,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:01:03,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:01:03,672 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:01:03,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:01:03,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:01:03,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:01:03,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:01:03,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:01:03,674 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:01:03,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:01:03,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:01:03,675 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:01:03,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:01:03,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:01:03,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:01:03,676 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:01:03,676 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:01:03,676 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:01:03,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:01:03,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:01:03,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:01:03,676 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:01:03,676 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:01:03,676 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 -> 26bf02dce57f3cc9fa9e6af5bd48026588368cec482f21797d4110581d1b8f61 [2025-03-04 11:01:03,885 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:01:03,890 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:01:03,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:01:03,894 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:01:03,894 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:01:03,895 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2025-03-04 11:01:04,946 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715d945cd/79cf213a2a874211847823f4e67f66f4/FLAGba3685890 [2025-03-04 11:01:05,144 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:01:05,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat1-ll_unwindbound2.c [2025-03-04 11:01:05,151 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715d945cd/79cf213a2a874211847823f4e67f66f4/FLAGba3685890 [2025-03-04 11:01:05,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/715d945cd/79cf213a2a874211847823f4e67f66f4 [2025-03-04 11:01:05,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:01:05,164 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:01:05,165 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:01:05,165 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:01:05,168 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:01:05,169 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,170 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64beb811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05, skipping insertion in model container [2025-03-04 11:01:05,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,182 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:01:05,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:01:05,304 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:01:05,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:01:05,336 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:01:05,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05 WrapperNode [2025-03-04 11:01:05,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:01:05,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:01:05,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:01:05,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:01:05,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,347 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,369 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 169 [2025-03-04 11:01:05,372 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:01:05,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:01:05,373 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:01:05,373 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:01:05,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,379 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,391 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 11:01:05,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,391 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,394 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,395 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,396 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:01:05,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:01:05,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:01:05,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:01:05,398 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (1/1) ... [2025-03-04 11:01:05,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:01:05,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:05,430 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 11:01:05,432 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 11:01:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:01:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:01:05,447 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:01:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:01:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:01:05,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:01:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:01:05,447 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:01:05,491 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:01:05,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:01:05,854 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2025-03-04 11:01:05,855 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:01:05,871 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:01:05,871 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:01:05,871 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:01:05 BoogieIcfgContainer [2025-03-04 11:01:05,871 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:01:05,873 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:01:05,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:01:05,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:01:05,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:01:05" (1/3) ... [2025-03-04 11:01:05,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed9707c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:01:05, skipping insertion in model container [2025-03-04 11:01:05,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:01:05" (2/3) ... [2025-03-04 11:01:05,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ed9707c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:01:05, skipping insertion in model container [2025-03-04 11:01:05,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:01:05" (3/3) ... [2025-03-04 11:01:05,878 INFO L128 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound2.c [2025-03-04 11:01:05,889 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:01:05,891 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fermat1-ll_unwindbound2.c that has 3 procedures, 227 locations, 1 initial locations, 3 loop locations, and 98 error locations. [2025-03-04 11:01:05,926 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:01:05,933 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;@1a81217f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:01:05,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 98 error locations. [2025-03-04 11:01:05,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:01:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 11:01:05,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:05,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 11:01:05,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:05,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:05,943 INFO L85 PathProgramCache]: Analyzing trace with hash 252190, now seen corresponding path program 1 times [2025-03-04 11:01:05,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:05,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890928634] [2025-03-04 11:01:05,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:05,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:05,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 11:01:06,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 11:01:06,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:06,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:06,058 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 11:01:06,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:06,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890928634] [2025-03-04 11:01:06,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890928634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:06,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:06,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:01:06,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689648738] [2025-03-04 11:01:06,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:06,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:01:06,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:06,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:01:06,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:06,080 INFO L87 Difference]: Start difference. First operand has 227 states, 120 states have (on average 1.9083333333333334) internal successors, (229), 218 states have internal predecessors, (229), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 11:01:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:06,165 INFO L93 Difference]: Finished difference Result 427 states and 471 transitions. [2025-03-04 11:01:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:01:06,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2025-03-04 11:01:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:06,173 INFO L225 Difference]: With dead ends: 427 [2025-03-04 11:01:06,173 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 11:01:06,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:06,180 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 13 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:06,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 394 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:06,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 11:01:06,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2025-03-04 11:01:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 115 states have (on average 1.7739130434782608) internal successors, (204), 198 states have internal predecessors, (204), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:01:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 214 transitions. [2025-03-04 11:01:06,228 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 214 transitions. Word has length 3 [2025-03-04 11:01:06,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:06,229 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 214 transitions. [2025-03-04 11:01:06,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 11:01:06,229 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 214 transitions. [2025-03-04 11:01:06,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 11:01:06,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:06,229 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 11:01:06,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:01:06,230 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:06,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash 7818079, now seen corresponding path program 1 times [2025-03-04 11:01:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:06,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706522549] [2025-03-04 11:01:06,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:06,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 11:01:06,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 11:01:06,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:06,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:06,266 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 11:01:06,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:06,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706522549] [2025-03-04 11:01:06,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706522549] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:06,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:06,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:01:06,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003572926] [2025-03-04 11:01:06,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:06,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:01:06,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:06,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:01:06,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:06,272 INFO L87 Difference]: Start difference. First operand 206 states and 214 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 11:01:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:06,315 INFO L93 Difference]: Finished difference Result 206 states and 214 transitions. [2025-03-04 11:01:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:01:06,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-04 11:01:06,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:06,318 INFO L225 Difference]: With dead ends: 206 [2025-03-04 11:01:06,318 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 11:01:06,319 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:06,319 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 12 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:06,320 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 381 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:06,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 11:01:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2025-03-04 11:01:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 115 states have (on average 1.7391304347826086) internal successors, (200), 194 states have internal predecessors, (200), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:01:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 210 transitions. [2025-03-04 11:01:06,340 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 210 transitions. Word has length 4 [2025-03-04 11:01:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:06,340 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 210 transitions. [2025-03-04 11:01:06,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 11:01:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 210 transitions. [2025-03-04 11:01:06,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:01:06,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:06,340 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:06,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:01:06,340 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:06,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:06,341 INFO L85 PathProgramCache]: Analyzing trace with hash 325866139, now seen corresponding path program 1 times [2025-03-04 11:01:06,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:06,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320163726] [2025-03-04 11:01:06,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:06,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:06,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:01:06,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:01:06,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:06,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:01:06,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956475274] [2025-03-04 11:01:06,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:06,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:06,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:06,355 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 11:01:06,357 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 11:01:06,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:01:06,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:01:06,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:06,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:06,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:01:06,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:06,423 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 11:01:06,423 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:01:06,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:06,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320163726] [2025-03-04 11:01:06,423 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:01:06,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956475274] [2025-03-04 11:01:06,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956475274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:06,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:06,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:01:06,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239619084] [2025-03-04 11:01:06,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:06,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:01:06,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:06,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:01:06,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:06,424 INFO L87 Difference]: Start difference. First operand 202 states and 210 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:01:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:06,456 INFO L93 Difference]: Finished difference Result 202 states and 210 transitions. [2025-03-04 11:01:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:01:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 11:01:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:06,458 INFO L225 Difference]: With dead ends: 202 [2025-03-04 11:01:06,458 INFO L226 Difference]: Without dead ends: 200 [2025-03-04 11:01:06,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:06,458 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 8 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:06,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 381 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:06,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-04 11:01:06,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2025-03-04 11:01:06,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 115 states have (on average 1.7217391304347827) internal successors, (198), 192 states have internal predecessors, (198), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:01:06,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 208 transitions. [2025-03-04 11:01:06,472 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 208 transitions. Word has length 8 [2025-03-04 11:01:06,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:06,472 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 208 transitions. [2025-03-04 11:01:06,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:01:06,472 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 208 transitions. [2025-03-04 11:01:06,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:01:06,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:06,472 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:06,478 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 11:01:06,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:06,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:06,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1205435852, now seen corresponding path program 1 times [2025-03-04 11:01:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:06,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812864701] [2025-03-04 11:01:06,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:06,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:01:06,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:01:06,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:06,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:01:06,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [52594944] [2025-03-04 11:01:06,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:06,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:06,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:06,697 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 11:01:06,697 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 11:01:06,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:01:06,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:01:06,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:06,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:06,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:01:06,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:06,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:01:06,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812864701] [2025-03-04 11:01:06,773 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:01:06,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52594944] [2025-03-04 11:01:06,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52594944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:06,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:06,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:01:06,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983477644] [2025-03-04 11:01:06,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:06,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:01:06,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:06,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:01:06,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:06,774 INFO L87 Difference]: Start difference. First operand 200 states and 208 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:06,815 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2025-03-04 11:01:06,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:01:06,815 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-04 11:01:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:06,817 INFO L225 Difference]: With dead ends: 200 [2025-03-04 11:01:06,817 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 11:01:06,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:06,818 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 162 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:06,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 188 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 11:01:06,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-04 11:01:06,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 115 states have (on average 1.7043478260869565) internal successors, (196), 190 states have internal predecessors, (196), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:01:06,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 206 transitions. [2025-03-04 11:01:06,827 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 206 transitions. Word has length 25 [2025-03-04 11:01:06,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:06,832 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 206 transitions. [2025-03-04 11:01:06,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:06,832 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 206 transitions. [2025-03-04 11:01:06,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:01:06,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:06,833 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:06,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:01:07,033 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,SelfDestructingSolverStorable3 [2025-03-04 11:01:07,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:07,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1286194415, now seen corresponding path program 1 times [2025-03-04 11:01:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83487384] [2025-03-04 11:01:07,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:07,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:01:07,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:01:07,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:07,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:01:07,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:07,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83487384] [2025-03-04 11:01:07,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83487384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:01:07,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213836157] [2025-03-04 11:01:07,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:07,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:07,189 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 11:01:07,190 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 11:01:07,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:01:07,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:01:07,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:07,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:07,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:01:07,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:07,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:01:07,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:01:07,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213836157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:07,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:01:07,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 11:01:07,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273002584] [2025-03-04 11:01:07,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:07,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:01:07,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:07,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:01:07,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:01:07,315 INFO L87 Difference]: Start difference. First operand 198 states and 206 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:07,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:07,413 INFO L93 Difference]: Finished difference Result 198 states and 206 transitions. [2025-03-04 11:01:07,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:01:07,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-04 11:01:07,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:07,414 INFO L225 Difference]: With dead ends: 198 [2025-03-04 11:01:07,414 INFO L226 Difference]: Without dead ends: 196 [2025-03-04 11:01:07,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:01:07,415 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 161 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:07,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 675 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:01:07,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-04 11:01:07,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2025-03-04 11:01:07,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 115 states have (on average 1.6869565217391305) internal successors, (194), 188 states have internal predecessors, (194), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:01:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 204 transitions. [2025-03-04 11:01:07,427 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 204 transitions. Word has length 26 [2025-03-04 11:01:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:07,427 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 204 transitions. [2025-03-04 11:01:07,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:07,427 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 204 transitions. [2025-03-04 11:01:07,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 11:01:07,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:07,428 INFO L218 NwaCegarLoop]: trace histogram [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 11:01:07,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:01:07,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:07,628 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:07,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:07,629 INFO L85 PathProgramCache]: Analyzing trace with hash -917743283, now seen corresponding path program 1 times [2025-03-04 11:01:07,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:07,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301371710] [2025-03-04 11:01:07,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:07,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:07,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 11:01:07,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 11:01:07,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:07,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:07,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:07,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:07,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301371710] [2025-03-04 11:01:07,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301371710] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:07,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:07,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:01:07,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103443871] [2025-03-04 11:01:07,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:07,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:01:07,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:07,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:01:07,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:01:07,711 INFO L87 Difference]: Start difference. First operand 196 states and 204 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:07,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:07,741 INFO L93 Difference]: Finished difference Result 275 states and 284 transitions. [2025-03-04 11:01:07,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:01:07,741 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 11:01:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:07,743 INFO L225 Difference]: With dead ends: 275 [2025-03-04 11:01:07,743 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 11:01:07,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:01:07,745 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 84 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 567 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 11:01:07,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 567 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:07,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 11:01:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 223. [2025-03-04 11:01:07,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6928571428571428) internal successors, (237), 214 states have internal predecessors, (237), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:01:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 249 transitions. [2025-03-04 11:01:07,752 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 249 transitions. Word has length 28 [2025-03-04 11:01:07,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:07,753 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 249 transitions. [2025-03-04 11:01:07,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:07,753 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 249 transitions. [2025-03-04 11:01:07,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-04 11:01:07,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:07,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:07,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:01:07,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:07,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1614729456, now seen corresponding path program 1 times [2025-03-04 11:01:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:07,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767787000] [2025-03-04 11:01:07,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:07,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 11:01:07,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 11:01:07,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:07,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:07,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:07,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767787000] [2025-03-04 11:01:07,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767787000] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:07,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:07,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:01:07,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583359042] [2025-03-04 11:01:07,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:07,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:01:07,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:07,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:01:07,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:01:07,802 INFO L87 Difference]: Start difference. First operand 223 states and 249 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:07,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:07,828 INFO L93 Difference]: Finished difference Result 252 states and 276 transitions. [2025-03-04 11:01:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:01:07,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-04 11:01:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:07,831 INFO L225 Difference]: With dead ends: 252 [2025-03-04 11:01:07,831 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 11:01:07,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:01:07,831 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 8 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:07,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 570 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 11:01:07,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2025-03-04 11:01:07,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 140 states have (on average 1.6785714285714286) internal successors, (235), 214 states have internal predecessors, (235), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:01:07,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 247 transitions. [2025-03-04 11:01:07,838 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 247 transitions. Word has length 29 [2025-03-04 11:01:07,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:07,839 INFO L471 AbstractCegarLoop]: Abstraction has 223 states and 247 transitions. [2025-03-04 11:01:07,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:07,839 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 247 transitions. [2025-03-04 11:01:07,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 11:01:07,840 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:07,840 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:07,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:01:07,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:07,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:07,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1271818318, now seen corresponding path program 1 times [2025-03-04 11:01:07,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:07,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508656956] [2025-03-04 11:01:07,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:07,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:07,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 11:01:07,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 11:01:07,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:07,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:07,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508656956] [2025-03-04 11:01:07,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508656956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:07,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:07,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:01:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102554677] [2025-03-04 11:01:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:07,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:01:07,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:07,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:01:07,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:07,876 INFO L87 Difference]: Start difference. First operand 223 states and 247 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:07,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:07,929 INFO L93 Difference]: Finished difference Result 275 states and 301 transitions. [2025-03-04 11:01:07,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:01:07,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-04 11:01:07,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:07,931 INFO L225 Difference]: With dead ends: 275 [2025-03-04 11:01:07,931 INFO L226 Difference]: Without dead ends: 272 [2025-03-04 11:01:07,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:07,931 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 141 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:07,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 274 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2025-03-04 11:01:07,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 238. [2025-03-04 11:01:07,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 155 states have (on average 1.664516129032258) internal successors, (258), 229 states have internal predecessors, (258), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:01:07,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 270 transitions. [2025-03-04 11:01:07,938 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 270 transitions. Word has length 31 [2025-03-04 11:01:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:07,938 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 270 transitions. [2025-03-04 11:01:07,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 270 transitions. [2025-03-04 11:01:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 11:01:07,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:07,939 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:01:07,939 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash 771662345, now seen corresponding path program 1 times [2025-03-04 11:01:07,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:07,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962046388] [2025-03-04 11:01:07,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:07,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:07,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 11:01:07,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 11:01:07,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:07,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:07,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:07,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:07,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962046388] [2025-03-04 11:01:07,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962046388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:07,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:07,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:01:07,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688231756] [2025-03-04 11:01:07,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:07,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:01:07,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:07,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:01:07,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:01:07,980 INFO L87 Difference]: Start difference. First operand 238 states and 270 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:08,082 INFO L93 Difference]: Finished difference Result 278 states and 303 transitions. [2025-03-04 11:01:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:01:08,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-04 11:01:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:08,084 INFO L225 Difference]: With dead ends: 278 [2025-03-04 11:01:08,084 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 11:01:08,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:01:08,085 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 151 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:08,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 431 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:01:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 11:01:08,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 241. [2025-03-04 11:01:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 158 states have (on average 1.6455696202531647) internal successors, (260), 232 states have internal predecessors, (260), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:01:08,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 272 transitions. [2025-03-04 11:01:08,092 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 272 transitions. Word has length 32 [2025-03-04 11:01:08,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:08,092 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 272 transitions. [2025-03-04 11:01:08,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:08,092 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 272 transitions. [2025-03-04 11:01:08,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 11:01:08,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:08,093 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:08,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:01:08,093 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:08,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:08,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1848270932, now seen corresponding path program 1 times [2025-03-04 11:01:08,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:08,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474917999] [2025-03-04 11:01:08,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:08,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:08,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:01:08,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:01:08,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:08,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:01:08,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1535949177] [2025-03-04 11:01:08,104 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:08,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:08,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:08,106 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 11:01:08,108 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 11:01:08,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 11:01:08,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 11:01:08,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:08,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:08,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:01:08,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:08,165 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:08,166 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:01:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474917999] [2025-03-04 11:01:08,166 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:01:08,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535949177] [2025-03-04 11:01:08,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535949177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:08,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:08,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:01:08,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560154704] [2025-03-04 11:01:08,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:08,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:01:08,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:08,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:01:08,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:08,178 INFO L87 Difference]: Start difference. First operand 241 states and 272 transitions. Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:08,279 INFO L93 Difference]: Finished difference Result 390 states and 436 transitions. [2025-03-04 11:01:08,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:01:08,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-04 11:01:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:08,282 INFO L225 Difference]: With dead ends: 390 [2025-03-04 11:01:08,282 INFO L226 Difference]: Without dead ends: 387 [2025-03-04 11:01:08,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:08,283 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:08,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 368 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:01:08,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-04 11:01:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 313. [2025-03-04 11:01:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 227 states have (on average 1.669603524229075) internal successors, (379), 301 states have internal predecessors, (379), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:01:08,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 397 transitions. [2025-03-04 11:01:08,295 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 397 transitions. Word has length 33 [2025-03-04 11:01:08,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:08,295 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 397 transitions. [2025-03-04 11:01:08,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 397 transitions. [2025-03-04 11:01:08,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-04 11:01:08,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:08,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:08,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:01:08,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:08,500 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:08,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:08,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1461823897, now seen corresponding path program 1 times [2025-03-04 11:01:08,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:08,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242751903] [2025-03-04 11:01:08,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:08,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:08,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:01:08,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:01:08,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:08,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:08,619 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:01:08,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242751903] [2025-03-04 11:01:08,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242751903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:01:08,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222614554] [2025-03-04 11:01:08,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:08,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:08,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:08,622 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 11:01:08,623 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 11:01:08,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 11:01:08,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 11:01:08,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:08,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:08,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:01:08,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:08,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:01:08,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:01:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:01:09,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222614554] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:01:09,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:01:09,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2025-03-04 11:01:09,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660708375] [2025-03-04 11:01:09,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:01:09,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:01:09,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:09,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:01:09,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:01:09,008 INFO L87 Difference]: Start difference. First operand 313 states and 397 transitions. Second operand has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:01:09,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:09,320 INFO L93 Difference]: Finished difference Result 430 states and 471 transitions. [2025-03-04 11:01:09,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:01:09,321 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2025-03-04 11:01:09,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:09,323 INFO L225 Difference]: With dead ends: 430 [2025-03-04 11:01:09,323 INFO L226 Difference]: Without dead ends: 427 [2025-03-04 11:01:09,323 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:01:09,325 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 689 mSDsluCounter, 919 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:09,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 1091 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:01:09,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-04 11:01:09,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 319. [2025-03-04 11:01:09,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 233 states have (on average 1.648068669527897) internal successors, (384), 307 states have internal predecessors, (384), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:01:09,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 402 transitions. [2025-03-04 11:01:09,339 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 402 transitions. Word has length 34 [2025-03-04 11:01:09,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:09,340 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 402 transitions. [2025-03-04 11:01:09,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.0) internal successors, (78), 14 states have internal predecessors, (78), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 3 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:01:09,340 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 402 transitions. [2025-03-04 11:01:09,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:01:09,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:09,341 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:09,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:01:09,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:01:09,542 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:09,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:09,542 INFO L85 PathProgramCache]: Analyzing trace with hash -358454587, now seen corresponding path program 1 times [2025-03-04 11:01:09,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:09,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121290102] [2025-03-04 11:01:09,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:09,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:09,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:01:09,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:01:09,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:09,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:01:09,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [586089007] [2025-03-04 11:01:09,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:09,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:09,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:09,552 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 11:01:09,554 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 11:01:09,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:01:09,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:01:09,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:09,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:09,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:01:09,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:09,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:01:09,727 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:01:09,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121290102] [2025-03-04 11:01:09,823 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:01:09,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586089007] [2025-03-04 11:01:09,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586089007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:01:09,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:01:09,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 11:01:09,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312163414] [2025-03-04 11:01:09,823 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:01:09,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:01:09,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:09,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:01:09,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:01:09,825 INFO L87 Difference]: Start difference. First operand 319 states and 402 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:01:11,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:11,612 INFO L93 Difference]: Finished difference Result 499 states and 616 transitions. [2025-03-04 11:01:11,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 11:01:11,613 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2025-03-04 11:01:11,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:11,614 INFO L225 Difference]: With dead ends: 499 [2025-03-04 11:01:11,614 INFO L226 Difference]: Without dead ends: 472 [2025-03-04 11:01:11,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:01:11,615 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 428 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:11,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 520 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 11:01:11,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-04 11:01:11,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 438. [2025-03-04 11:01:11,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 349 states have (on average 1.5501432664756447) internal successors, (541), 423 states have internal predecessors, (541), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 11:01:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 565 transitions. [2025-03-04 11:01:11,638 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 565 transitions. Word has length 36 [2025-03-04 11:01:11,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:11,638 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 565 transitions. [2025-03-04 11:01:11,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:01:11,638 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 565 transitions. [2025-03-04 11:01:11,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 11:01:11,638 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:11,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:11,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:01:11,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:11,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:11,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:11,840 INFO L85 PathProgramCache]: Analyzing trace with hash -877469917, now seen corresponding path program 1 times [2025-03-04 11:01:11,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:11,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194427062] [2025-03-04 11:01:11,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:11,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:11,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 11:01:11,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 11:01:11,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:11,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:01:11,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [146967203] [2025-03-04 11:01:11,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:11,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:11,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:11,849 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:01:11,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:01:11,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 11:01:11,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 11:01:11,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:11,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:11,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:01:11,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:11,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:11,898 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:01:11,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:11,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194427062] [2025-03-04 11:01:11,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:01:11,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146967203] [2025-03-04 11:01:11,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146967203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:11,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:11,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:01:11,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147575583] [2025-03-04 11:01:11,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:11,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:01:11,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:11,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:01:11,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:11,900 INFO L87 Difference]: Start difference. First operand 438 states and 565 transitions. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:12,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:12,058 INFO L93 Difference]: Finished difference Result 630 states and 798 transitions. [2025-03-04 11:01:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:01:12,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 38 [2025-03-04 11:01:12,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:12,060 INFO L225 Difference]: With dead ends: 630 [2025-03-04 11:01:12,061 INFO L226 Difference]: Without dead ends: 589 [2025-03-04 11:01:12,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:12,061 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 117 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:12,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 271 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:01:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-04 11:01:12,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 557. [2025-03-04 11:01:12,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 465 states have (on average 1.4903225806451612) internal successors, (693), 539 states have internal predecessors, (693), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 11:01:12,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 723 transitions. [2025-03-04 11:01:12,103 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 723 transitions. Word has length 38 [2025-03-04 11:01:12,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:12,103 INFO L471 AbstractCegarLoop]: Abstraction has 557 states and 723 transitions. [2025-03-04 11:01:12,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:01:12,103 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 723 transitions. [2025-03-04 11:01:12,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:01:12,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:12,104 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:01:12,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 11:01:12,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:12,304 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:12,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:12,305 INFO L85 PathProgramCache]: Analyzing trace with hash -632926895, now seen corresponding path program 1 times [2025-03-04 11:01:12,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:12,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986376698] [2025-03-04 11:01:12,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:12,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:12,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:01:12,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:01:12,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:12,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:12,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:12,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986376698] [2025-03-04 11:01:12,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986376698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:12,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:12,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:01:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951595016] [2025-03-04 11:01:12,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:12,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:01:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:12,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:01:12,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:01:12,361 INFO L87 Difference]: Start difference. First operand 557 states and 723 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:01:12,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:12,431 INFO L93 Difference]: Finished difference Result 645 states and 824 transitions. [2025-03-04 11:01:12,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:01:12,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 56 [2025-03-04 11:01:12,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:12,434 INFO L225 Difference]: With dead ends: 645 [2025-03-04 11:01:12,434 INFO L226 Difference]: Without dead ends: 644 [2025-03-04 11:01:12,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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 11:01:12,435 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 63 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:12,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 940 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:12,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2025-03-04 11:01:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 618. [2025-03-04 11:01:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.4780114722753346) internal successors, (773), 596 states have internal predecessors, (773), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 11:01:12,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 807 transitions. [2025-03-04 11:01:12,461 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 807 transitions. Word has length 56 [2025-03-04 11:01:12,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:12,461 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 807 transitions. [2025-03-04 11:01:12,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:01:12,461 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 807 transitions. [2025-03-04 11:01:12,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:01:12,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:12,462 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:12,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:01:12,462 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:12,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:12,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1854102845, now seen corresponding path program 1 times [2025-03-04 11:01:12,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:12,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280642396] [2025-03-04 11:01:12,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:12,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:12,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:01:12,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:01:12,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:12,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:12,522 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:12,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:12,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280642396] [2025-03-04 11:01:12,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280642396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:12,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:12,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:01:12,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834736075] [2025-03-04 11:01:12,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:12,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:01:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:12,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:01:12,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:01:12,524 INFO L87 Difference]: Start difference. First operand 618 states and 807 transitions. Second operand has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:01:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:12,608 INFO L93 Difference]: Finished difference Result 1126 states and 1480 transitions. [2025-03-04 11:01:12,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:01:12,608 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 57 [2025-03-04 11:01:12,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:12,610 INFO L225 Difference]: With dead ends: 1126 [2025-03-04 11:01:12,610 INFO L226 Difference]: Without dead ends: 618 [2025-03-04 11:01:12,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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 11:01:12,611 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 20 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:12,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 776 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:12,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-03-04 11:01:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2025-03-04 11:01:12,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.474187380497132) internal successors, (771), 596 states have internal predecessors, (771), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 11:01:12,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 805 transitions. [2025-03-04 11:01:12,631 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 805 transitions. Word has length 57 [2025-03-04 11:01:12,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:12,631 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 805 transitions. [2025-03-04 11:01:12,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.6) internal successors, (48), 6 states have internal predecessors, (48), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:01:12,632 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 805 transitions. [2025-03-04 11:01:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-04 11:01:12,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:12,632 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:12,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:01:12,632 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:12,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:12,633 INFO L85 PathProgramCache]: Analyzing trace with hash 933851991, now seen corresponding path program 1 times [2025-03-04 11:01:12,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:12,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895400472] [2025-03-04 11:01:12,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:12,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:12,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-04 11:01:12,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-04 11:01:12,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:12,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:12,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:12,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895400472] [2025-03-04 11:01:12,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895400472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:12,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:12,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:01:12,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231877709] [2025-03-04 11:01:12,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:12,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:01:12,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:12,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:01:12,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:01:12,685 INFO L87 Difference]: Start difference. First operand 618 states and 805 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:01:12,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:12,895 INFO L93 Difference]: Finished difference Result 651 states and 806 transitions. [2025-03-04 11:01:12,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:01:12,896 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 83 [2025-03-04 11:01:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:12,898 INFO L225 Difference]: With dead ends: 651 [2025-03-04 11:01:12,898 INFO L226 Difference]: Without dead ends: 650 [2025-03-04 11:01:12,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:01:12,899 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 82 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:12,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 379 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:01:12,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-04 11:01:12,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 618. [2025-03-04 11:01:12,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 618 states, 523 states have (on average 1.468451242829828) internal successors, (768), 596 states have internal predecessors, (768), 17 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 11:01:12,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 802 transitions. [2025-03-04 11:01:12,918 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 802 transitions. Word has length 83 [2025-03-04 11:01:12,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:12,918 INFO L471 AbstractCegarLoop]: Abstraction has 618 states and 802 transitions. [2025-03-04 11:01:12,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:01:12,918 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 802 transitions. [2025-03-04 11:01:12,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 11:01:12,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:12,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:12,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 11:01:12,919 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:12,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:12,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1115360503, now seen corresponding path program 1 times [2025-03-04 11:01:12,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:12,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492531179] [2025-03-04 11:01:12,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:12,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:12,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 11:01:12,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 11:01:12,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:12,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:13,017 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492531179] [2025-03-04 11:01:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492531179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:13,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:13,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:01:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314765581] [2025-03-04 11:01:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:13,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:01:13,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:13,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:01:13,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:01:13,018 INFO L87 Difference]: Start difference. First operand 618 states and 802 transitions. Second operand has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:01:13,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:13,115 INFO L93 Difference]: Finished difference Result 807 states and 1020 transitions. [2025-03-04 11:01:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:01:13,115 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 84 [2025-03-04 11:01:13,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:13,116 INFO L225 Difference]: With dead ends: 807 [2025-03-04 11:01:13,117 INFO L226 Difference]: Without dead ends: 299 [2025-03-04 11:01:13,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:01:13,118 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 112 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:13,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 552 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:01:13,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-03-04 11:01:13,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 242. [2025-03-04 11:01:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 198 states have (on average 1.2474747474747474) internal successors, (247), 230 states have internal predecessors, (247), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:01:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 261 transitions. [2025-03-04 11:01:13,128 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 261 transitions. Word has length 84 [2025-03-04 11:01:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:13,129 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 261 transitions. [2025-03-04 11:01:13,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.0) internal successors, (70), 8 states have internal predecessors, (70), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:01:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 261 transitions. [2025-03-04 11:01:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-03-04 11:01:13,131 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:13,131 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:13,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 11:01:13,131 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:13,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:13,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1115359286, now seen corresponding path program 1 times [2025-03-04 11:01:13,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:13,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655993283] [2025-03-04 11:01:13,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:13,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:13,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-03-04 11:01:13,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-03-04 11:01:13,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:13,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:13,211 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:13,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:13,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655993283] [2025-03-04 11:01:13,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655993283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:13,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:13,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:01:13,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149704508] [2025-03-04 11:01:13,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:13,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:01:13,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:13,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:01:13,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:01:13,213 INFO L87 Difference]: Start difference. First operand 242 states and 261 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:01:13,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:13,388 INFO L93 Difference]: Finished difference Result 246 states and 261 transitions. [2025-03-04 11:01:13,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:01:13,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 84 [2025-03-04 11:01:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:13,389 INFO L225 Difference]: With dead ends: 246 [2025-03-04 11:01:13,389 INFO L226 Difference]: Without dead ends: 245 [2025-03-04 11:01:13,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:01:13,390 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 166 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:13,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 213 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:01:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-03-04 11:01:13,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2025-03-04 11:01:13,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 198 states have (on average 1.2424242424242424) internal successors, (246), 230 states have internal predecessors, (246), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:01:13,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 260 transitions. [2025-03-04 11:01:13,404 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 260 transitions. Word has length 84 [2025-03-04 11:01:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:13,404 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 260 transitions. [2025-03-04 11:01:13,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:01:13,405 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 260 transitions. [2025-03-04 11:01:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 11:01:13,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:13,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:13,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:01:13,406 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:13,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:13,406 INFO L85 PathProgramCache]: Analyzing trace with hash -216437170, now seen corresponding path program 1 times [2025-03-04 11:01:13,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:13,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960017730] [2025-03-04 11:01:13,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:13,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:13,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 11:01:13,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 11:01:13,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:13,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:13,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960017730] [2025-03-04 11:01:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960017730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:01:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806917278] [2025-03-04 11:01:13,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:13,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:01:13,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:13,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:01:13,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:01:13,512 INFO L87 Difference]: Start difference. First operand 242 states and 260 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:01:13,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:13,597 INFO L93 Difference]: Finished difference Result 279 states and 298 transitions. [2025-03-04 11:01:13,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:01:13,597 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 85 [2025-03-04 11:01:13,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:13,598 INFO L225 Difference]: With dead ends: 279 [2025-03-04 11:01:13,598 INFO L226 Difference]: Without dead ends: 278 [2025-03-04 11:01:13,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:01:13,599 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 40 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:13,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 665 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:13,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-03-04 11:01:13,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 269. [2025-03-04 11:01:13,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 223 states have (on average 1.2197309417040358) internal successors, (272), 255 states have internal predecessors, (272), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:01:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 288 transitions. [2025-03-04 11:01:13,614 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 288 transitions. Word has length 85 [2025-03-04 11:01:13,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:13,614 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 288 transitions. [2025-03-04 11:01:13,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 11:01:13,615 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 288 transitions. [2025-03-04 11:01:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 11:01:13,615 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:13,615 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:13,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 11:01:13,616 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:13,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash -786918505, now seen corresponding path program 1 times [2025-03-04 11:01:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:13,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452761308] [2025-03-04 11:01:13,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:13,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 11:01:13,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 11:01:13,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:13,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:13,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452761308] [2025-03-04 11:01:13,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452761308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:01:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790448444] [2025-03-04 11:01:13,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:13,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:13,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:13,736 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:01:13,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:01:13,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 11:01:13,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 11:01:13,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:13,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:13,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:01:13,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:13,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:01:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:14,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790448444] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:01:14,006 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:01:14,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 17 [2025-03-04 11:01:14,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3293607] [2025-03-04 11:01:14,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:01:14,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:01:14,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:14,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:01:14,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:01:14,008 INFO L87 Difference]: Start difference. First operand 269 states and 288 transitions. Second operand has 18 states, 17 states have (on average 9.0) internal successors, (153), 18 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 11:01:14,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:14,227 INFO L93 Difference]: Finished difference Result 404 states and 434 transitions. [2025-03-04 11:01:14,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:01:14,228 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 9.0) internal successors, (153), 18 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 89 [2025-03-04 11:01:14,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:14,229 INFO L225 Difference]: With dead ends: 404 [2025-03-04 11:01:14,229 INFO L226 Difference]: Without dead ends: 401 [2025-03-04 11:01:14,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2025-03-04 11:01:14,230 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 114 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:14,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1121 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:01:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-04 11:01:14,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 375. [2025-03-04 11:01:14,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 324 states have (on average 1.1944444444444444) internal successors, (387), 356 states have internal predecessors, (387), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 11:01:14,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 409 transitions. [2025-03-04 11:01:14,252 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 409 transitions. Word has length 89 [2025-03-04 11:01:14,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:14,252 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 409 transitions. [2025-03-04 11:01:14,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 9.0) internal successors, (153), 18 states have internal predecessors, (153), 6 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 11:01:14,253 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 409 transitions. [2025-03-04 11:01:14,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 11:01:14,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:14,253 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:14,259 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:01:14,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:14,458 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:14,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:14,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1932513094, now seen corresponding path program 1 times [2025-03-04 11:01:14,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:14,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253832548] [2025-03-04 11:01:14,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:14,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:14,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 11:01:14,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:01:14,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:14,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:14,547 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:14,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:14,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253832548] [2025-03-04 11:01:14,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253832548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:01:14,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808590406] [2025-03-04 11:01:14,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:14,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:14,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:14,549 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:01:14,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:01:14,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 11:01:14,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 11:01:14,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:14,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:14,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:01:14,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:01:14,659 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:01:14,746 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:14,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1808590406] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:01:14,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:01:14,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 8] total 8 [2025-03-04 11:01:14,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956830887] [2025-03-04 11:01:14,746 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:01:14,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:01:14,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:14,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:01:14,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:01:14,747 INFO L87 Difference]: Start difference. First operand 375 states and 409 transitions. Second operand has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:01:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:14,820 INFO L93 Difference]: Finished difference Result 511 states and 554 transitions. [2025-03-04 11:01:14,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:01:14,820 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 91 [2025-03-04 11:01:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:14,821 INFO L225 Difference]: With dead ends: 511 [2025-03-04 11:01:14,821 INFO L226 Difference]: Without dead ends: 348 [2025-03-04 11:01:14,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 177 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:01:14,822 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 16 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:14,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 630 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:14,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-03-04 11:01:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-03-04 11:01:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 298 states have (on average 1.1711409395973154) internal successors, (349), 330 states have internal predecessors, (349), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:01:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 369 transitions. [2025-03-04 11:01:14,835 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 369 transitions. Word has length 91 [2025-03-04 11:01:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:14,835 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 369 transitions. [2025-03-04 11:01:14,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 3 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:01:14,835 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 369 transitions. [2025-03-04 11:01:14,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 11:01:14,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:14,836 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:14,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:01:15,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:15,037 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:15,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:15,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1413944123, now seen corresponding path program 1 times [2025-03-04 11:01:15,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:15,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557496994] [2025-03-04 11:01:15,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:15,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:15,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 11:01:15,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 11:01:15,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:15,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:15,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:15,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557496994] [2025-03-04 11:01:15,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557496994] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:01:15,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661797550] [2025-03-04 11:01:15,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:15,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:15,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:15,131 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:01:15,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:01:15,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 11:01:15,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 11:01:15,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:15,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:15,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:01:15,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:15,208 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 11:01:15,208 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:01:15,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661797550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:15,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:01:15,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2025-03-04 11:01:15,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115203239] [2025-03-04 11:01:15,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:15,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:01:15,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:15,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:01:15,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:01:15,209 INFO L87 Difference]: Start difference. First operand 348 states and 369 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:01:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:15,280 INFO L93 Difference]: Finished difference Result 575 states and 614 transitions. [2025-03-04 11:01:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:01:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 99 [2025-03-04 11:01:15,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:15,282 INFO L225 Difference]: With dead ends: 575 [2025-03-04 11:01:15,282 INFO L226 Difference]: Without dead ends: 379 [2025-03-04 11:01:15,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:01:15,283 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 28 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 733 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:15,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 733 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-03-04 11:01:15,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 348. [2025-03-04 11:01:15,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 301 states have (on average 1.1528239202657806) internal successors, (347), 330 states have internal predecessors, (347), 10 states have call successors, (10), 7 states have call predecessors, (10), 7 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:01:15,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 367 transitions. [2025-03-04 11:01:15,298 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 367 transitions. Word has length 99 [2025-03-04 11:01:15,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:15,298 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 367 transitions. [2025-03-04 11:01:15,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 7 states have internal predecessors, (83), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-04 11:01:15,299 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 367 transitions. [2025-03-04 11:01:15,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 11:01:15,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:15,299 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:15,305 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:01:15,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 11:01:15,500 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:15,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:15,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1201342297, now seen corresponding path program 1 times [2025-03-04 11:01:15,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:15,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681044937] [2025-03-04 11:01:15,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:15,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:15,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 11:01:15,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:01:15,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:15,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:01:15,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1668103279] [2025-03-04 11:01:15,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:15,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:01:15,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:01:15,515 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:01:15,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:01:15,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 11:01:15,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 11:01:15,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:15,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:15,554 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:01:15,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:01:15,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:15,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:01:15,761 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:01:15,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681044937] [2025-03-04 11:01:15,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:01:15,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1668103279] [2025-03-04 11:01:15,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1668103279] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:01:15,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:01:15,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 11:01:15,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114070824] [2025-03-04 11:01:15,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:01:15,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:01:15,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:15,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:01:15,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:01:15,763 INFO L87 Difference]: Start difference. First operand 348 states and 367 transitions. Second operand has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:01:15,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:15,996 INFO L93 Difference]: Finished difference Result 579 states and 657 transitions. [2025-03-04 11:01:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:01:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 104 [2025-03-04 11:01:15,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:15,999 INFO L225 Difference]: With dead ends: 579 [2025-03-04 11:01:15,999 INFO L226 Difference]: Without dead ends: 528 [2025-03-04 11:01:15,999 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:01:15,999 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 257 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:16,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [261 Valid, 345 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:01:16,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-04 11:01:16,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 472. [2025-03-04 11:01:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 436 states have (on average 1.165137614678899) internal successors, (508), 450 states have internal predecessors, (508), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 11:01:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 536 transitions. [2025-03-04 11:01:16,022 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 536 transitions. Word has length 104 [2025-03-04 11:01:16,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:16,022 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 536 transitions. [2025-03-04 11:01:16,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 11:01:16,022 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 536 transitions. [2025-03-04 11:01:16,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-04 11:01:16,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:16,023 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:16,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 11:01:16,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 11:01:16,228 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:16,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:16,228 INFO L85 PathProgramCache]: Analyzing trace with hash 838601199, now seen corresponding path program 1 times [2025-03-04 11:01:16,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:16,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38317516] [2025-03-04 11:01:16,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:16,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:16,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-04 11:01:16,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-04 11:01:16,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:16,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:16,267 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 11:01:16,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:16,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38317516] [2025-03-04 11:01:16,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38317516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:16,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:16,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:01:16,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346437384] [2025-03-04 11:01:16,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:16,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:01:16,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:16,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:01:16,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:16,269 INFO L87 Difference]: Start difference. First operand 472 states and 536 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:01:16,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:16,293 INFO L93 Difference]: Finished difference Result 490 states and 550 transitions. [2025-03-04 11:01:16,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:01:16,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 149 [2025-03-04 11:01:16,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:16,294 INFO L225 Difference]: With dead ends: 490 [2025-03-04 11:01:16,294 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 11:01:16,295 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:01:16,295 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:16,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 190 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:16,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 11:01:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-04 11:01:16,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 197 states have (on average 1.0253807106598984) internal successors, (202), 199 states have internal predecessors, (202), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:01:16,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 218 transitions. [2025-03-04 11:01:16,306 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 218 transitions. Word has length 149 [2025-03-04 11:01:16,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:16,306 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 218 transitions. [2025-03-04 11:01:16,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 11:01:16,306 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 218 transitions. [2025-03-04 11:01:16,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-04 11:01:16,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:01:16,307 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:16,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 11:01:16,307 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 95 more)] === [2025-03-04 11:01:16,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:01:16,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1666807051, now seen corresponding path program 1 times [2025-03-04 11:01:16,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:01:16,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439165313] [2025-03-04 11:01:16,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:01:16,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:01:16,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-04 11:01:16,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-04 11:01:16,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:01:16,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:01:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-04 11:01:16,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:01:16,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439165313] [2025-03-04 11:01:16,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439165313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:01:16,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:01:16,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:01:16,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963521113] [2025-03-04 11:01:16,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:01:16,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:01:16,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:01:16,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:01:16,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:01:16,394 INFO L87 Difference]: Start difference. First operand 215 states and 218 transitions. Second operand has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:01:16,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:01:16,430 INFO L93 Difference]: Finished difference Result 215 states and 218 transitions. [2025-03-04 11:01:16,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:01:16,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 177 [2025-03-04 11:01:16,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:01:16,431 INFO L225 Difference]: With dead ends: 215 [2025-03-04 11:01:16,431 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:01:16,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:01:16,431 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 3 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:01:16,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 441 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:01:16,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:01:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:01:16,431 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 11:01:16,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:01:16,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 177 [2025-03-04 11:01:16,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:01:16,432 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:01:16,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.142857142857142) internal successors, (148), 7 states have internal predecessors, (148), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-04 11:01:16,432 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:01:16,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:01:16,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 98 remaining) [2025-03-04 11:01:16,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 98 remaining) [2025-03-04 11:01:16,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 98 remaining) [2025-03-04 11:01:16,434 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 98 remaining) [2025-03-04 11:01:16,435 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 98 remaining) [2025-03-04 11:01:16,436 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 98 remaining) [2025-03-04 11:01:16,437 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 98 remaining) [2025-03-04 11:01:16,438 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 98 remaining) [2025-03-04 11:01:16,439 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 98 remaining) [2025-03-04 11:01:16,440 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 98 remaining) [2025-03-04 11:01:16,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 98 remaining) [2025-03-04 11:01:16,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 98 remaining) [2025-03-04 11:01:16,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 98 remaining) [2025-03-04 11:01:16,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 98 remaining) [2025-03-04 11:01:16,441 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 98 remaining) [2025-03-04 11:01:16,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 11:01:16,443 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:01:16,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:01:24,910 WARN L286 SmtUtils]: Spent 8.20s on a formula simplification. DAG size of input: 65 DAG size of output: 49 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-04 11:01:33,286 WARN L286 SmtUtils]: Spent 8.37s on a formula simplification. DAG size of input: 68 DAG size of output: 52 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-04 11:01:33,331 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:01:33,343 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,344 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,349 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,350 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,354 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,354 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2025-03-04 11:01:33,354 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:01:33 BoogieIcfgContainer [2025-03-04 11:01:33,354 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:01:33,355 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:01:33,355 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:01:33,355 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:01:33,356 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:01:05" (3/4) ... [2025-03-04 11:01:33,357 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:01:33,364 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-04 11:01:33,364 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:01:33,370 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-03-04 11:01:33,370 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:01:33,370 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:01:33,370 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:01:33,437 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:01:33,438 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:01:33,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:01:33,439 INFO L158 Benchmark]: Toolchain (without parser) took 28274.77ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 106.8MB in the beginning and 245.2MB in the end (delta: -138.4MB). Peak memory consumption was 42.8MB. Max. memory is 16.1GB. [2025-03-04 11:01:33,440 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:01:33,440 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.06ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:01:33,441 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.64ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:01:33,441 INFO L158 Benchmark]: Boogie Preprocessor took 24.64ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:01:33,441 INFO L158 Benchmark]: IcfgBuilder took 474.00ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 62.6MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:01:33,441 INFO L158 Benchmark]: TraceAbstraction took 27481.02ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 62.6MB in the beginning and 253.4MB in the end (delta: -190.8MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. [2025-03-04 11:01:33,441 INFO L158 Benchmark]: Witness Printer took 83.05ms. Allocated memory is still 327.2MB. Free memory was 253.4MB in the beginning and 245.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:01:33,443 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.06ms. Allocated memory is still 142.6MB. Free memory was 106.8MB in the beginning and 94.3MB in the end (delta: 12.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.64ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 92.7MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.64ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 91.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 474.00ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 62.6MB in the end (delta: 28.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 27481.02ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 62.6MB in the beginning and 253.4MB in the end (delta: -190.8MB). Peak memory consumption was 144.6MB. Max. memory is 16.1GB. * Witness Printer took 83.05ms. Allocated memory is still 327.2MB. Free memory was 253.4MB in the beginning and 245.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 56]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 47]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: 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 3 procedures, 227 locations, 98 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 25, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3058 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3018 mSDsluCounter, 13096 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9146 mSDsCounter, 181 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2948 IncrementalHoareTripleChecker+Invalid, 3129 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 181 mSolverCounterUnsat, 3950 mSDtfsCounter, 2948 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1050 GetRequests, 890 SyntacticMatches, 5 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=618occurred in iteration=14, InterpolantAutomatonStates: 161, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 607 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2068 NumberOfCodeBlocks, 2068 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2108 ConstructedInterpolants, 15 QuantifiedInterpolants, 7294 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1099 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 34 InterpolantComputations, 20 PerfectInterpolantSequences, 406/462 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 98 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: (((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter <= 2147483645)) && (A <= 2147483647)) && (3 <= counter)) || (((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (r <= 0)) && (A <= 2147483647)) && (counter == 2))) || ((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (3 == v)) && (counter <= 2147483645)) && (A <= 2147483647)) && (0 <= A)) && (3 <= counter))) - InvariantResult [Line: 34]: Location Invariant Derived location invariant: ((((((((((counter == 3) && (((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0)) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (r <= 0)) && (A <= 2147483647)) || (((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (4 <= counter)) && (counter <= 2147483646))) || ((((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (3 == v)) && (A <= 2147483647)) && (4 <= counter)) && (counter <= 2147483646)) && (0 <= A))) || ((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (counter == 0)) && (A <= 2147483647))) - InvariantResult [Line: 39]: Location Invariant Derived location invariant: (((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (v == 1)) && (A <= 2147483647)) && (counter == 1)) || (((((((((((__int128) u + 1) >= 0) ? (((__int128) u + 1) % 2) : ((((__int128) u + 1) % 2) + 2)) == 0) && (((A >= 0) ? (A % 2) : ((A % 2) + 2)) == 1)) && ((((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1)) * ((((__int128) -1 + u) >= 0) ? (((__int128) -1 + u) / 2) : ((((__int128) -1 + u) / 2) - 1))) <= ((__int128) u + 2147483644))) && (3 == v)) && (A <= 2147483647)) && (0 <= A)) && (counter == 2))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:01:33,471 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