./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/ps2-ll_valuebound5.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 1b50d522769b95768e9038f61a48a3b927d40a7b91b44cb14af45fcd08759b69 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 02:32:12,130 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 02:32:12,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 02:32:12,188 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 02:32:12,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 02:32:12,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 02:32:12,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 02:32:12,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 02:32:12,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 02:32:12,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 02:32:12,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 02:32:12,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 02:32:12,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 02:32:12,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 02:32:12,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 02:32:12,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 02:32:12,213 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 02:32:12,213 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 02:32:12,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 02:32:12,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 02:32:12,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 02:32:12,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 02:32:12,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 02:32:12,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 02:32:12,214 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 02:32:12,214 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 02:32:12,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 02:32:12,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 02:32:12,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 02:32:12,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 02:32:12,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 02:32:12,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:32:12,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 02:32:12,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 02:32:12,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 02:32:12,216 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 -> 1b50d522769b95768e9038f61a48a3b927d40a7b91b44cb14af45fcd08759b69 [2025-03-09 02:32:12,443 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 02:32:12,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 02:32:12,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 02:32:12,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 02:32:12,452 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 02:32:12,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound5.c [2025-03-09 02:32:13,571 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ab8a977/112a89556fbb4b7eaf5e424cce621a0b/FLAGd2d30c2d3 [2025-03-09 02:32:13,803 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 02:32:13,806 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps2-ll_valuebound5.c [2025-03-09 02:32:13,813 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ab8a977/112a89556fbb4b7eaf5e424cce621a0b/FLAGd2d30c2d3 [2025-03-09 02:32:14,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9ab8a977/112a89556fbb4b7eaf5e424cce621a0b [2025-03-09 02:32:14,148 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 02:32:14,149 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 02:32:14,150 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 02:32:14,150 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 02:32:14,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 02:32:14,153 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1831b2c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14, skipping insertion in model container [2025-03-09 02:32:14,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 02:32:14,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:32:14,271 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 02:32:14,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 02:32:14,293 INFO L204 MainTranslator]: Completed translation [2025-03-09 02:32:14,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14 WrapperNode [2025-03-09 02:32:14,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 02:32:14,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 02:32:14,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 02:32:14,295 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 02:32:14,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,304 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,315 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 62 [2025-03-09 02:32:14,315 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 02:32:14,316 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 02:32:14,316 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 02:32:14,316 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 02:32:14,322 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,335 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-09 02:32:14,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,339 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 02:32:14,344 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 02:32:14,344 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 02:32:14,344 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 02:32:14,345 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (1/1) ... [2025-03-09 02:32:14,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 02:32:14,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:14,376 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-09 02:32:14,381 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-09 02:32:14,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 02:32:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 02:32:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 02:32:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 02:32:14,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 02:32:14,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 02:32:14,445 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 02:32:14,446 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 02:32:14,613 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2025-03-09 02:32:14,613 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 02:32:14,621 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 02:32:14,622 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 02:32:14,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:32:14 BoogieIcfgContainer [2025-03-09 02:32:14,622 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 02:32:14,624 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 02:32:14,624 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 02:32:14,627 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 02:32:14,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 02:32:14" (1/3) ... [2025-03-09 02:32:14,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4a5951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:32:14, skipping insertion in model container [2025-03-09 02:32:14,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 02:32:14" (2/3) ... [2025-03-09 02:32:14,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4a5951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 02:32:14, skipping insertion in model container [2025-03-09 02:32:14,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:32:14" (3/3) ... [2025-03-09 02:32:14,630 INFO L128 eAbstractionObserver]: Analyzing ICFG ps2-ll_valuebound5.c [2025-03-09 02:32:14,642 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 02:32:14,644 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps2-ll_valuebound5.c that has 2 procedures, 61 locations, 1 initial locations, 1 loop locations, and 22 error locations. [2025-03-09 02:32:14,683 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 02:32:14,694 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;@72527f68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 02:32:14,695 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-03-09 02:32:14,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 02:32:14,702 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:14,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 02:32:14,703 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:14,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:14,709 INFO L85 PathProgramCache]: Analyzing trace with hash 82037427, now seen corresponding path program 1 times [2025-03-09 02:32:14,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:14,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802937907] [2025-03-09 02:32:14,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:14,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:14,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 02:32:14,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 02:32:14,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:14,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:14,801 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-09 02:32:14,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:14,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802937907] [2025-03-09 02:32:14,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802937907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:14,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:32:14,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:32:14,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428389861] [2025-03-09 02:32:14,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:14,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 02:32:14,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:14,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 02:32:14,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:32:14,824 INFO L87 Difference]: Start difference. First operand has 61 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 57 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:32:14,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:14,840 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2025-03-09 02:32:14,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 02:32:14,842 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-09 02:32:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:14,847 INFO L225 Difference]: With dead ends: 116 [2025-03-09 02:32:14,847 INFO L226 Difference]: Without dead ends: 52 [2025-03-09 02:32:14,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 02:32:14,852 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:14,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:32:14,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-09 02:32:14,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-09 02:32:14,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:32:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2025-03-09 02:32:14,881 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 5 [2025-03-09 02:32:14,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:14,882 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2025-03-09 02:32:14,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:32:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2025-03-09 02:32:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-09 02:32:14,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:14,882 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 02:32:14,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 02:32:14,883 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:14,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:14,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1751777251, now seen corresponding path program 1 times [2025-03-09 02:32:14,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:14,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997126691] [2025-03-09 02:32:14,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:14,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:14,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:32:14,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:32:14,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:14,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:32:14,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2019508942] [2025-03-09 02:32:14,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:14,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:14,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:14,900 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-09 02:32:14,902 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-09 02:32:14,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 02:32:14,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 02:32:14,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:14,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:14,949 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:32:14,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:14,967 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-09 02:32:14,967 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:32:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:14,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997126691] [2025-03-09 02:32:14,968 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:32:14,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019508942] [2025-03-09 02:32:14,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2019508942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:14,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:32:14,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:32:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116288149] [2025-03-09 02:32:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:14,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:32:14,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:14,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:32:14,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:32:14,970 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:32:15,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:15,040 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-03-09 02:32:15,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:32:15,041 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-09 02:32:15,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:15,042 INFO L225 Difference]: With dead ends: 84 [2025-03-09 02:32:15,043 INFO L226 Difference]: Without dead ends: 80 [2025-03-09 02:32:15,043 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-09 02:32:15,044 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:15,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 52 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-09 02:32:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2025-03-09 02:32:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.6444444444444444) internal successors, (74), 64 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:15,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2025-03-09 02:32:15,052 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 6 [2025-03-09 02:32:15,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:15,052 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2025-03-09 02:32:15,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:32:15,052 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2025-03-09 02:32:15,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 02:32:15,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:15,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:32:15,059 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-09 02:32:15,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:15,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:15,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:15,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1529480082, now seen corresponding path program 1 times [2025-03-09 02:32:15,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:15,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675017987] [2025-03-09 02:32:15,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:15,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:15,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 02:32:15,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 02:32:15,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:15,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:15,298 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-09 02:32:15,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:15,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675017987] [2025-03-09 02:32:15,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [675017987] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:15,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:32:15,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:32:15,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893428130] [2025-03-09 02:32:15,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:15,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:32:15,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:15,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:32:15,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:32:15,300 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:32:15,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:15,379 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2025-03-09 02:32:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:32:15,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 02:32:15,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:15,380 INFO L225 Difference]: With dead ends: 86 [2025-03-09 02:32:15,380 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 02:32:15,380 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-09 02:32:15,381 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:15,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 56 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:15,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 02:32:15,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2025-03-09 02:32:15,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.52) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2025-03-09 02:32:15,394 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 7 [2025-03-09 02:32:15,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:15,395 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2025-03-09 02:32:15,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:32:15,395 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2025-03-09 02:32:15,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-09 02:32:15,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:15,395 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:32:15,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 02:32:15,395 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:15,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:15,396 INFO L85 PathProgramCache]: Analyzing trace with hash -566907559, now seen corresponding path program 1 times [2025-03-09 02:32:15,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:15,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210951417] [2025-03-09 02:32:15,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:15,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 02:32:15,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 02:32:15,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:15,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:15,462 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-09 02:32:15,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:15,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210951417] [2025-03-09 02:32:15,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210951417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:15,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:32:15,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:32:15,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187373022] [2025-03-09 02:32:15,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:15,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:32:15,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:15,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:32:15,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:32:15,468 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 02:32:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:15,546 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2025-03-09 02:32:15,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:32:15,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-09 02:32:15,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:15,547 INFO L225 Difference]: With dead ends: 82 [2025-03-09 02:32:15,547 INFO L226 Difference]: Without dead ends: 70 [2025-03-09 02:32:15,547 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-09 02:32:15,548 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 37 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:15,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 54 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:15,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-09 02:32:15,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2025-03-09 02:32:15,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 62 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:15,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-09 02:32:15,554 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 10 [2025-03-09 02:32:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:15,554 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-09 02:32:15,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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-09 02:32:15,554 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-09 02:32:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-09 02:32:15,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:15,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:32:15,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 02:32:15,555 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:15,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:15,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1704329907, now seen corresponding path program 1 times [2025-03-09 02:32:15,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:15,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171604606] [2025-03-09 02:32:15,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:15,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:15,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 02:32:15,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 02:32:15,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:15,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:15,664 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-09 02:32:15,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:15,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171604606] [2025-03-09 02:32:15,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171604606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:15,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:32:15,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 02:32:15,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929419076] [2025-03-09 02:32:15,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:15,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 02:32:15,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:15,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 02:32:15,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 02:32:15,668 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:32:15,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:15,683 INFO L93 Difference]: Finished difference Result 68 states and 69 transitions. [2025-03-09 02:32:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 02:32:15,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-03-09 02:32:15,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:15,684 INFO L225 Difference]: With dead ends: 68 [2025-03-09 02:32:15,684 INFO L226 Difference]: Without dead ends: 66 [2025-03-09 02:32:15,685 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-09 02:32:15,685 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:15,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 93 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:32:15,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-09 02:32:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-09 02:32:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 62 states have internal predecessors, (63), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2025-03-09 02:32:15,692 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 19 [2025-03-09 02:32:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:15,694 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2025-03-09 02:32:15,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:32:15,694 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2025-03-09 02:32:15,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 02:32:15,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:15,696 INFO L218 NwaCegarLoop]: trace histogram [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-09 02:32:15,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 02:32:15,696 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:15,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:15,700 INFO L85 PathProgramCache]: Analyzing trace with hash 794793545, now seen corresponding path program 1 times [2025-03-09 02:32:15,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:15,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984059683] [2025-03-09 02:32:15,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:15,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:15,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 02:32:15,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 02:32:15,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:15,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:15,784 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-09 02:32:15,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:15,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984059683] [2025-03-09 02:32:15,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984059683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:15,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:32:15,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:32:15,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723227763] [2025-03-09 02:32:15,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:15,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:32:15,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:15,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:32:15,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:32:15,787 INFO L87 Difference]: Start difference. First operand 66 states and 67 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:32:15,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:15,866 INFO L93 Difference]: Finished difference Result 69 states and 71 transitions. [2025-03-09 02:32:15,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:32:15,866 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2025-03-09 02:32:15,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:15,867 INFO L225 Difference]: With dead ends: 69 [2025-03-09 02:32:15,867 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 02:32:15,867 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-09 02:32:15,868 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:15,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 64 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:15,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 02:32:15,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2025-03-09 02:32:15,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 63 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2025-03-09 02:32:15,872 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 23 [2025-03-09 02:32:15,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:15,873 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2025-03-09 02:32:15,873 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:32:15,873 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2025-03-09 02:32:15,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-09 02:32:15,874 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:15,874 INFO L218 NwaCegarLoop]: trace 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] [2025-03-09 02:32:15,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 02:32:15,874 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:15,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:15,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1131203891, now seen corresponding path program 1 times [2025-03-09 02:32:15,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:15,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908917227] [2025-03-09 02:32:15,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:15,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:15,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 02:32:15,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 02:32:15,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:15,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:15,951 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-09 02:32:15,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908917227] [2025-03-09 02:32:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908917227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:15,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 02:32:15,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 02:32:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108106886] [2025-03-09 02:32:15,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:15,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:32:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:15,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:32:15,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-09 02:32:15,952 INFO L87 Difference]: Start difference. First operand 67 states and 68 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:32:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:16,022 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2025-03-09 02:32:16,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:32:16,022 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2025-03-09 02:32:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:16,022 INFO L225 Difference]: With dead ends: 69 [2025-03-09 02:32:16,022 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 02:32:16,023 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-09 02:32:16,023 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:16,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:16,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 02:32:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-09 02:32:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 45 states have (on average 1.4444444444444444) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:16,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2025-03-09 02:32:16,031 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 24 [2025-03-09 02:32:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:16,031 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2025-03-09 02:32:16,031 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:32:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2025-03-09 02:32:16,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 02:32:16,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:16,032 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 02:32:16,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 02:32:16,032 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:16,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:16,032 INFO L85 PathProgramCache]: Analyzing trace with hash -460212757, now seen corresponding path program 1 times [2025-03-09 02:32:16,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:16,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263018933] [2025-03-09 02:32:16,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:16,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:16,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:32:16,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:32:16,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:16,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:32:16,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [101883110] [2025-03-09 02:32:16,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:16,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:16,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:16,058 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-09 02:32:16,063 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-09 02:32:16,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 02:32:16,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 02:32:16,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:16,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:16,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:32:16,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:16,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:32:16,217 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:16,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263018933] [2025-03-09 02:32:16,220 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:32:16,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101883110] [2025-03-09 02:32:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [101883110] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:32:16,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:32:16,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 02:32:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263070792] [2025-03-09 02:32:16,220 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:32:16,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:32:16,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:16,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:32:16,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:32:16,221 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:16,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:16,361 INFO L93 Difference]: Finished difference Result 131 states and 162 transitions. [2025-03-09 02:32:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:32:16,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-03-09 02:32:16,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:16,362 INFO L225 Difference]: With dead ends: 131 [2025-03-09 02:32:16,362 INFO L226 Difference]: Without dead ends: 127 [2025-03-09 02:32:16,362 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 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-09 02:32:16,363 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 91 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:16,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 101 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:16,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-09 02:32:16,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 99. [2025-03-09 02:32:16,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 93 states have internal predecessors, (116), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:32:16,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 124 transitions. [2025-03-09 02:32:16,368 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 124 transitions. Word has length 26 [2025-03-09 02:32:16,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:16,368 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 124 transitions. [2025-03-09 02:32:16,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 6 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 124 transitions. [2025-03-09 02:32:16,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 02:32:16,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:16,369 INFO L218 NwaCegarLoop]: trace histogram [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-09 02:32:16,377 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-09 02:32:16,569 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,SelfDestructingSolverStorable7 [2025-03-09 02:32:16,570 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:16,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:16,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1381693564, now seen corresponding path program 1 times [2025-03-09 02:32:16,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:16,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004186223] [2025-03-09 02:32:16,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:16,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:16,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:32:16,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:32:16,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:16,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:16,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:16,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004186223] [2025-03-09 02:32:16,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004186223] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:16,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1418421569] [2025-03-09 02:32:16,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:16,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:16,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:16,689 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-09 02:32:16,691 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-09 02:32:16,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 02:32:16,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 02:32:16,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:16,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:16,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:32:16,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:16,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:32:16,889 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:16,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1418421569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:32:16,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:32:16,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 02:32:16,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127051209] [2025-03-09 02:32:16,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:32:16,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:32:16,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:16,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:32:16,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:32:16,890 INFO L87 Difference]: Start difference. First operand 99 states and 124 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:32:16,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:16,993 INFO L93 Difference]: Finished difference Result 99 states and 124 transitions. [2025-03-09 02:32:16,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:32:16,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2025-03-09 02:32:16,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:16,994 INFO L225 Difference]: With dead ends: 99 [2025-03-09 02:32:16,994 INFO L226 Difference]: Without dead ends: 96 [2025-03-09 02:32:16,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2025-03-09 02:32:16,997 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 76 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:16,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 52 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-09 02:32:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-09 02:32:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 90 states have internal predecessors, (109), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:32:17,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2025-03-09 02:32:17,007 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 27 [2025-03-09 02:32:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:17,007 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2025-03-09 02:32:17,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:32:17,010 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2025-03-09 02:32:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 02:32:17,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:17,010 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-09 02:32:17,016 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-09 02:32:17,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:17,211 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:17,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:17,212 INFO L85 PathProgramCache]: Analyzing trace with hash 117172489, now seen corresponding path program 1 times [2025-03-09 02:32:17,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:17,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297315027] [2025-03-09 02:32:17,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:17,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:17,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:32:17,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:32:17,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:17,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:17,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:17,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297315027] [2025-03-09 02:32:17,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297315027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:17,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033992668] [2025-03-09 02:32:17,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:17,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:17,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:17,281 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-09 02:32:17,283 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-09 02:32:17,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 02:32:17,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 02:32:17,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:17,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:17,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 02:32:17,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:17,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:17,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:32:17,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:17,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033992668] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:32:17,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:32:17,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-09 02:32:17,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153107219] [2025-03-09 02:32:17,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:32:17,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 02:32:17,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:17,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 02:32:17,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:32:17,432 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:32:17,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:17,557 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2025-03-09 02:32:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 02:32:17,557 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 28 [2025-03-09 02:32:17,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:17,558 INFO L225 Difference]: With dead ends: 108 [2025-03-09 02:32:17,558 INFO L226 Difference]: Without dead ends: 101 [2025-03-09 02:32:17,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:32:17,558 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:17,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 80 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:17,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-09 02:32:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 91. [2025-03-09 02:32:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 77 states have (on average 1.2597402597402598) internal successors, (97), 85 states have internal predecessors, (97), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:32:17,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 105 transitions. [2025-03-09 02:32:17,567 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 105 transitions. Word has length 28 [2025-03-09 02:32:17,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:17,567 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 105 transitions. [2025-03-09 02:32:17,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 02:32:17,567 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 105 transitions. [2025-03-09 02:32:17,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-09 02:32:17,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:17,568 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 02:32:17,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-09 02:32:17,768 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-09 02:32:17,768 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:17,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:17,769 INFO L85 PathProgramCache]: Analyzing trace with hash 933612583, now seen corresponding path program 1 times [2025-03-09 02:32:17,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:17,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802883082] [2025-03-09 02:32:17,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:17,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:17,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:32:17,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:32:17,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:17,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:17,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802883082] [2025-03-09 02:32:17,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802883082] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:17,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1631724534] [2025-03-09 02:32:17,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:17,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:17,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:17,848 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-09 02:32:17,849 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-09 02:32:17,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-09 02:32:17,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-09 02:32:17,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:17,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:17,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 02:32:17,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:18,005 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 02:32:18,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:32:18,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1631724534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:18,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:32:18,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-09 02:32:18,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371226653] [2025-03-09 02:32:18,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:18,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:32:18,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:18,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:32:18,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:32:18,006 INFO L87 Difference]: Start difference. First operand 91 states and 105 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:32:18,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:18,066 INFO L93 Difference]: Finished difference Result 91 states and 105 transitions. [2025-03-09 02:32:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:32:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-03-09 02:32:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:18,067 INFO L225 Difference]: With dead ends: 91 [2025-03-09 02:32:18,067 INFO L226 Difference]: Without dead ends: 79 [2025-03-09 02:32:18,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-09 02:32:18,067 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 17 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:18,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 50 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-09 02:32:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-09 02:32:18,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:32:18,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2025-03-09 02:32:18,077 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 30 [2025-03-09 02:32:18,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:18,077 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2025-03-09 02:32:18,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 02:32:18,078 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2025-03-09 02:32:18,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 02:32:18,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:18,078 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 02:32:18,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 02:32:18,278 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-09 02:32:18,279 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:18,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:18,283 INFO L85 PathProgramCache]: Analyzing trace with hash 223651391, now seen corresponding path program 1 times [2025-03-09 02:32:18,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:18,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94054048] [2025-03-09 02:32:18,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:18,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:18,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 02:32:18,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 02:32:18,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:18,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:18,331 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:32:18,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94054048] [2025-03-09 02:32:18,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94054048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:18,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437328887] [2025-03-09 02:32:18,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:18,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:18,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:18,336 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-09 02:32:18,344 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-09 02:32:18,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 02:32:18,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 02:32:18,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:18,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:18,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:32:18,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:18,415 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:32:18,416 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:32:18,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437328887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:18,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:32:18,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 02:32:18,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200858196] [2025-03-09 02:32:18,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:18,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 02:32:18,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:18,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 02:32:18,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 02:32:18,417 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:18,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:18,432 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-03-09 02:32:18,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 02:32:18,432 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 39 [2025-03-09 02:32:18,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:18,433 INFO L225 Difference]: With dead ends: 79 [2025-03-09 02:32:18,433 INFO L226 Difference]: Without dead ends: 78 [2025-03-09 02:32:18,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-09 02:32:18,434 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:18,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 49 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:32:18,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2025-03-09 02:32:18,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2025-03-09 02:32:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 02:32:18,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2025-03-09 02:32:18,439 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 39 [2025-03-09 02:32:18,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:18,440 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2025-03-09 02:32:18,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:18,440 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2025-03-09 02:32:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-09 02:32:18,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:18,441 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 02:32:18,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 02:32:18,641 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-09 02:32:18,642 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:18,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:18,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1656741473, now seen corresponding path program 1 times [2025-03-09 02:32:18,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:18,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590481934] [2025-03-09 02:32:18,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:18,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:18,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:32:18,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:32:18,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:18,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:18,685 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:32:18,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:18,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590481934] [2025-03-09 02:32:18,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590481934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:18,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903571195] [2025-03-09 02:32:18,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:18,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:18,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:18,691 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-09 02:32:18,692 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-09 02:32:18,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 02:32:18,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 02:32:18,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:18,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:18,718 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:32:18,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:32:18,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:32:18,786 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 02:32:18,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903571195] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:32:18,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:32:18,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-09 02:32:18,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756171007] [2025-03-09 02:32:18,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:32:18,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 02:32:18,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:18,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 02:32:18,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:32:18,787 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:32:18,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:18,823 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2025-03-09 02:32:18,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 02:32:18,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 40 [2025-03-09 02:32:18,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:18,824 INFO L225 Difference]: With dead ends: 91 [2025-03-09 02:32:18,824 INFO L226 Difference]: Without dead ends: 90 [2025-03-09 02:32:18,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 02:32:18,825 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:18,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 99 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:32:18,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-09 02:32:18,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2025-03-09 02:32:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.0769230769230769) internal successors, (84), 81 states have internal predecessors, (84), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:32:18,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-03-09 02:32:18,829 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 40 [2025-03-09 02:32:18,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:18,829 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-03-09 02:32:18,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 02:32:18,829 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-03-09 02:32:18,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-09 02:32:18,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:18,830 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-09 02:32:18,837 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-09 02:32:19,034 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-09 02:32:19,035 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:19,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash -44483479, now seen corresponding path program 1 times [2025-03-09 02:32:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:19,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425077205] [2025-03-09 02:32:19,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:19,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:19,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:32:19,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:32:19,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:19,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:19,175 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:32:19,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425077205] [2025-03-09 02:32:19,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425077205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:19,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390663627] [2025-03-09 02:32:19,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 02:32:19,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:19,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:19,177 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-09 02:32:19,178 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-09 02:32:19,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-09 02:32:19,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-09 02:32:19,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 02:32:19,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:19,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-09 02:32:19,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:19,389 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:32:19,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:32:19,545 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:32:19,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390663627] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:32:19,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:32:19,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-09 02:32:19,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736990503] [2025-03-09 02:32:19,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:32:19,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 02:32:19,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:19,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 02:32:19,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-09 02:32:19,548 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 20 states, 19 states have (on average 7.578947368421052) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:32:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:19,753 INFO L93 Difference]: Finished difference Result 127 states and 141 transitions. [2025-03-09 02:32:19,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-09 02:32:19,753 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 7.578947368421052) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 64 [2025-03-09 02:32:19,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:19,754 INFO L225 Difference]: With dead ends: 127 [2025-03-09 02:32:19,754 INFO L226 Difference]: Without dead ends: 126 [2025-03-09 02:32:19,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=248, Invalid=402, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:32:19,755 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:19,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 95 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:19,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-09 02:32:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2025-03-09 02:32:19,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 112 states have (on average 1.0982142857142858) internal successors, (123), 115 states have internal predecessors, (123), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:32:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2025-03-09 02:32:19,764 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 64 [2025-03-09 02:32:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:19,764 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2025-03-09 02:32:19,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 7.578947368421052) internal successors, (144), 20 states have internal predecessors, (144), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:32:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2025-03-09 02:32:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-09 02:32:19,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:19,766 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2025-03-09 02:32:19,774 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-09 02:32:19,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-09 02:32:19,967 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:19,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:19,967 INFO L85 PathProgramCache]: Analyzing trace with hash -64240475, now seen corresponding path program 2 times [2025-03-09 02:32:19,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:19,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251890574] [2025-03-09 02:32:19,968 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:32:19,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:19,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-09 02:32:19,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:32:19,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:32:19,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:20,118 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:32:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:20,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251890574] [2025-03-09 02:32:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251890574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:20,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391478093] [2025-03-09 02:32:20,119 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:32:20,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:20,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:20,124 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-09 02:32:20,127 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-09 02:32:20,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-09 02:32:20,164 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 68 of 68 statements. [2025-03-09 02:32:20,165 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:32:20,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:20,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 02:32:20,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:32:20,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:32:20,586 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-09 02:32:20,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391478093] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:32:20,586 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:32:20,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-09 02:32:20,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2623078] [2025-03-09 02:32:20,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:32:20,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 02:32:20,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:20,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 02:32:20,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:32:20,588 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:32:20,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:20,895 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-09 02:32:20,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 02:32:20,896 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Word has length 68 [2025-03-09 02:32:20,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:20,897 INFO L225 Difference]: With dead ends: 132 [2025-03-09 02:32:20,897 INFO L226 Difference]: Without dead ends: 131 [2025-03-09 02:32:20,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=321, Invalid=549, Unknown=0, NotChecked=0, Total=870 [2025-03-09 02:32:20,898 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 72 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:20,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 97 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:32:20,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-09 02:32:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2025-03-09 02:32:20,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 116 states have (on average 1.0775862068965518) internal successors, (125), 119 states have internal predecessors, (125), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-09 02:32:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 139 transitions. [2025-03-09 02:32:20,906 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 139 transitions. Word has length 68 [2025-03-09 02:32:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:20,907 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 139 transitions. [2025-03-09 02:32:20,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 7.238095238095238) internal successors, (152), 22 states have internal predecessors, (152), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-09 02:32:20,907 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 139 transitions. [2025-03-09 02:32:20,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-09 02:32:20,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:20,909 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 02:32:20,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 02:32:21,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-09 02:32:21,110 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:21,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:21,111 INFO L85 PathProgramCache]: Analyzing trace with hash -342284971, now seen corresponding path program 2 times [2025-03-09 02:32:21,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:21,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629017389] [2025-03-09 02:32:21,111 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:32:21,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:21,116 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-09 02:32:21,127 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:32:21,127 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:32:21,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 02:32:21,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1101771826] [2025-03-09 02:32:21,128 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:32:21,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:21,134 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-09 02:32:21,135 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-09 02:32:21,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 86 statements into 2 equivalence classes. [2025-03-09 02:32:21,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 86 of 86 statements. [2025-03-09 02:32:21,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:32:21,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:21,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:32:21,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:32:21,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:32:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 104 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-09 02:32:21,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629017389] [2025-03-09 02:32:21,403 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 02:32:21,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101771826] [2025-03-09 02:32:21,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101771826] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:32:21,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 02:32:21,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-09 02:32:21,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959255299] [2025-03-09 02:32:21,404 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 02:32:21,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 02:32:21,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:21,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 02:32:21,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-09 02:32:21,405 INFO L87 Difference]: Start difference. First operand 128 states and 139 transitions. Second operand has 12 states, 11 states have (on average 12.0) internal successors, (132), 12 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:32:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:21,650 INFO L93 Difference]: Finished difference Result 182 states and 199 transitions. [2025-03-09 02:32:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 02:32:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 12.0) internal successors, (132), 12 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 86 [2025-03-09 02:32:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:21,652 INFO L225 Difference]: With dead ends: 182 [2025-03-09 02:32:21,652 INFO L226 Difference]: Without dead ends: 181 [2025-03-09 02:32:21,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-03-09 02:32:21,653 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 91 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:21,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 251 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 02:32:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-09 02:32:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 174. [2025-03-09 02:32:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 159 states have (on average 1.0880503144654088) internal successors, (173), 162 states have internal predecessors, (173), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:32:21,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 193 transitions. [2025-03-09 02:32:21,659 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 193 transitions. Word has length 86 [2025-03-09 02:32:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:21,659 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 193 transitions. [2025-03-09 02:32:21,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 12.0) internal successors, (132), 12 states have internal predecessors, (132), 8 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-09 02:32:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 193 transitions. [2025-03-09 02:32:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-09 02:32:21,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:21,660 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-09 02:32:21,667 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-09 02:32:21,865 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,SelfDestructingSolverStorable15 [2025-03-09 02:32:21,865 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:21,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:21,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1544335479, now seen corresponding path program 2 times [2025-03-09 02:32:21,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:21,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26349286] [2025-03-09 02:32:21,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:32:21,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:21,874 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-09 02:32:21,875 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 100 statements. [2025-03-09 02:32:21,875 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:32:21,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:21,899 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-09 02:32:21,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26349286] [2025-03-09 02:32:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26349286] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:21,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093022501] [2025-03-09 02:32:21,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:32:21,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:21,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:21,902 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-09 02:32:21,904 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-09 02:32:21,927 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 100 statements into 2 equivalence classes. [2025-03-09 02:32:21,933 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 100 statements. [2025-03-09 02:32:21,933 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:32:21,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:21,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 02:32:21,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-09 02:32:22,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 02:32:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-09 02:32:22,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093022501] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 02:32:22,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 02:32:22,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-09 02:32:22,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401878139] [2025-03-09 02:32:22,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 02:32:22,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 02:32:22,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:22,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 02:32:22,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 02:32:22,111 INFO L87 Difference]: Start difference. First operand 174 states and 193 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:22,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:22,133 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2025-03-09 02:32:22,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 02:32:22,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 100 [2025-03-09 02:32:22,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:22,135 INFO L225 Difference]: With dead ends: 174 [2025-03-09 02:32:22,135 INFO L226 Difference]: Without dead ends: 173 [2025-03-09 02:32:22,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-09 02:32:22,136 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 37 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:22,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 50 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 02:32:22,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-09 02:32:22,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2025-03-09 02:32:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 159 states have (on average 1.050314465408805) internal successors, (167), 161 states have internal predecessors, (167), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:32:22,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 187 transitions. [2025-03-09 02:32:22,143 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 187 transitions. Word has length 100 [2025-03-09 02:32:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:22,143 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 187 transitions. [2025-03-09 02:32:22,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 187 transitions. [2025-03-09 02:32:22,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-09 02:32:22,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:22,144 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1] [2025-03-09 02:32:22,150 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-09 02:32:22,349 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,SelfDestructingSolverStorable16 [2025-03-09 02:32:22,349 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:22,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:22,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1510413407, now seen corresponding path program 2 times [2025-03-09 02:32:22,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:22,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181909732] [2025-03-09 02:32:22,350 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:32:22,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:22,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-09 02:32:22,381 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-09 02:32:22,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 02:32:22,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:22,665 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:32:22,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:22,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181909732] [2025-03-09 02:32:22,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181909732] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:22,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701899447] [2025-03-09 02:32:22,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 02:32:22,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:22,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:22,668 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:32:22,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 02:32:22,691 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-09 02:32:22,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 24 of 144 statements. [2025-03-09 02:32:22,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 02:32:22,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:22,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 02:32:22,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-09 02:32:22,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:32:22,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701899447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:22,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:32:22,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [15] total 21 [2025-03-09 02:32:22,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157513814] [2025-03-09 02:32:22,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:22,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 02:32:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:22,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 02:32:22,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-09 02:32:22,868 INFO L87 Difference]: Start difference. First operand 173 states and 187 transitions. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:22,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:32:22,950 INFO L93 Difference]: Finished difference Result 175 states and 189 transitions. [2025-03-09 02:32:22,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 02:32:22,950 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 144 [2025-03-09 02:32:22,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:32:22,952 INFO L225 Difference]: With dead ends: 175 [2025-03-09 02:32:22,952 INFO L226 Difference]: Without dead ends: 174 [2025-03-09 02:32:22,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2025-03-09 02:32:22,953 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:32:22,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 44 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:32:22,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2025-03-09 02:32:22,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2025-03-09 02:32:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 159 states have (on average 1.0251572327044025) internal successors, (163), 160 states have internal predecessors, (163), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:32:22,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 183 transitions. [2025-03-09 02:32:22,959 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 183 transitions. Word has length 144 [2025-03-09 02:32:22,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:32:22,959 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 183 transitions. [2025-03-09 02:32:22,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 8 states have internal predecessors, (37), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:32:22,959 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2025-03-09 02:32:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-09 02:32:22,960 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:32:22,960 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1] [2025-03-09 02:32:22,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 02:32:23,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-09 02:32:23,166 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:32:23,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:32:23,166 INFO L85 PathProgramCache]: Analyzing trace with hash -495904803, now seen corresponding path program 3 times [2025-03-09 02:32:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:32:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302874079] [2025-03-09 02:32:23,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:32:23,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:32:23,178 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 8 equivalence classes. [2025-03-09 02:32:23,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) and asserted 148 of 148 statements. [2025-03-09 02:32:23,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2025-03-09 02:32:23,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-09 02:32:23,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:32:23,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302874079] [2025-03-09 02:32:23,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302874079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:32:23,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228674819] [2025-03-09 02:32:23,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:32:23,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:32:23,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:32:23,588 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:32:23,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 02:32:23,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 148 statements into 8 equivalence classes. [2025-03-09 02:32:23,628 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 148 statements. [2025-03-09 02:32:23,628 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 02:32:23,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:32:23,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-09 02:32:23,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:32:44,305 WARN L873 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~y~0#1| Int)) (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (mod (+ |ULTIMATE.start_main_~y~0#1| .cse0) 2) 0) (<= .cse0 9223372036854775807) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |ULTIMATE.start_main_~y~0#1| (div (+ (* (- 1) |ULTIMATE.start_main_~y~0#1|) .cse0) 2)))))) is different from true [2025-03-09 02:32:48,326 INFO L134 CoverageAnalysis]: Checked inductivity of 448 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2025-03-09 02:32:48,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:32:48,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228674819] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:32:48,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:32:48,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 23 [2025-03-09 02:32:48,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997904319] [2025-03-09 02:32:48,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:32:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 02:32:48,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:32:48,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 02:32:48,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=423, Unknown=1, NotChecked=42, Total=552 [2025-03-09 02:32:48,327 INFO L87 Difference]: Start difference. First operand 172 states and 183 transitions. Second operand has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:33:01,407 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 22 DAG size of output: 31 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-03-09 02:33:13,579 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse0 (div (+ .cse2 (* (- 1) |c_ULTIMATE.start_main_~y~0#1|)) 2)) (.cse1 (+ |c_ULTIMATE.start_main_~y~0#1| .cse2))) (and (<= |c_ULTIMATE.start_main_~x~0#1| 4611686018427387903) (<= |c_ULTIMATE.start_main_~x~0#1| (+ |c_ULTIMATE.start_main_~y~0#1| .cse0)) (= (mod .cse1 2) 0) (<= .cse0 4611686018427387903) (= .cse1 (* |c_ULTIMATE.start_main_~x~0#1| 2))))) is different from true [2025-03-09 02:33:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:33:13,903 INFO L93 Difference]: Finished difference Result 174 states and 185 transitions. [2025-03-09 02:33:13,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 02:33:13,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148 [2025-03-09 02:33:13,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:33:13,908 INFO L225 Difference]: With dead ends: 174 [2025-03-09 02:33:13,908 INFO L226 Difference]: Without dead ends: 173 [2025-03-09 02:33:13,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=110, Invalid=596, Unknown=4, NotChecked=102, Total=812 [2025-03-09 02:33:13,908 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-09 02:33:13,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 37 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 79 Invalid, 0 Unknown, 45 Unchecked, 1.2s Time] [2025-03-09 02:33:13,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-03-09 02:33:13,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2025-03-09 02:33:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 159 states have (on average 1.0062893081761006) internal successors, (160), 159 states have internal predecessors, (160), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:33:13,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 180 transitions. [2025-03-09 02:33:13,927 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 180 transitions. Word has length 148 [2025-03-09 02:33:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:33:13,927 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 180 transitions. [2025-03-09 02:33:13,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.125) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 02:33:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 180 transitions. [2025-03-09 02:33:13,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-09 02:33:13,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 02:33:13,929 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2025-03-09 02:33:13,937 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 02:33:14,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:33:14,130 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-03-09 02:33:14,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 02:33:14,131 INFO L85 PathProgramCache]: Analyzing trace with hash 472277801, now seen corresponding path program 3 times [2025-03-09 02:33:14,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 02:33:14,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286580120] [2025-03-09 02:33:14,131 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:33:14,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 02:33:14,141 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 11 equivalence classes. [2025-03-09 02:33:14,197 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 206 of 206 statements. [2025-03-09 02:33:14,197 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:33:14,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:33:14,686 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 634 proven. 106 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 02:33:14,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 02:33:14,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286580120] [2025-03-09 02:33:14,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286580120] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 02:33:14,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1850933052] [2025-03-09 02:33:14,687 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 02:33:14,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:33:14,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 02:33:14,692 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 02:33:14,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 02:33:14,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 206 statements into 11 equivalence classes. [2025-03-09 02:33:14,803 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 206 of 206 statements. [2025-03-09 02:33:14,803 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-03-09 02:33:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 02:33:14,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 02:33:14,807 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 02:33:15,941 INFO L134 CoverageAnalysis]: Checked inductivity of 920 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-09 02:33:15,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 02:33:15,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1850933052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 02:33:15,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 02:33:15,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 26 [2025-03-09 02:33:15,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086600887] [2025-03-09 02:33:15,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 02:33:15,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-09 02:33:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 02:33:15,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-09 02:33:15,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:33:15,942 INFO L87 Difference]: Start difference. First operand 171 states and 180 transitions. Second operand has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:33:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 02:33:16,046 INFO L93 Difference]: Finished difference Result 175 states and 183 transitions. [2025-03-09 02:33:16,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 02:33:16,046 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 206 [2025-03-09 02:33:16,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 02:33:16,047 INFO L225 Difference]: With dead ends: 175 [2025-03-09 02:33:16,047 INFO L226 Difference]: Without dead ends: 0 [2025-03-09 02:33:16,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2025-03-09 02:33:16,048 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 02:33:16,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 384 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 02:33:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-09 02:33:16,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-09 02:33:16,048 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-09 02:33:16,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-09 02:33:16,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2025-03-09 02:33:16,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 02:33:16,049 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-09 02:33:16,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.357142857142858) internal successors, (159), 14 states have internal predecessors, (159), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-09 02:33:16,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-09 02:33:16,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-09 02:33:16,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-03-09 02:33:16,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-03-09 02:33:16,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-03-09 02:33:16,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-03-09 02:33:16,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-03-09 02:33:16,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-03-09 02:33:16,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-03-09 02:33:16,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-03-09 02:33:16,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-03-09 02:33:16,064 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-09 02:33:16,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 02:33:16,259 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 02:33:16,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-09 02:33:28,502 WARN L286 SmtUtils]: Spent 12.22s on a formula simplification. DAG size of input: 70 DAG size of output: 61 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-09 02:33:40,715 WARN L286 SmtUtils]: Spent 12.21s on a formula simplification. DAG size of input: 70 DAG size of output: 61 (called from [L 162] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.combineInter) [2025-03-09 02:33:40,728 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 02:33:40,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 02:33:40 BoogieIcfgContainer [2025-03-09 02:33:40,752 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 02:33:40,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 02:33:40,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 02:33:40,752 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 02:33:40,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 02:32:14" (3/4) ... [2025-03-09 02:33:40,754 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 02:33:40,759 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-09 02:33:40,763 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-09 02:33:40,764 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 02:33:40,764 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-09 02:33:40,764 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 02:33:40,848 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 02:33:40,848 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 02:33:40,848 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 02:33:40,849 INFO L158 Benchmark]: Toolchain (without parser) took 86699.58ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 109.9MB in the beginning and 139.6MB in the end (delta: -29.7MB). Peak memory consumption was 101.7MB. Max. memory is 16.1GB. [2025-03-09 02:33:40,850 INFO L158 Benchmark]: CDTParser took 0.55ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:33:40,850 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.42ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 98.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:33:40,851 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.74ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.9MB in the end (delta: 945.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 02:33:40,854 INFO L158 Benchmark]: Boogie Preprocessor took 26.34ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:33:40,854 INFO L158 Benchmark]: IcfgBuilder took 278.42ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 82.1MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 02:33:40,854 INFO L158 Benchmark]: TraceAbstraction took 86127.65ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 82.1MB in the beginning and 52.9MB in the end (delta: 29.2MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. [2025-03-09 02:33:40,854 INFO L158 Benchmark]: Witness Printer took 95.74ms. Allocated memory is still 176.2MB. Free memory was 52.9MB in the beginning and 139.6MB in the end (delta: -86.7MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2025-03-09 02:33:40,855 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.55ms. Allocated memory is still 201.3MB. Free memory is still 126.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 144.42ms. Allocated memory is still 142.6MB. Free memory was 109.9MB in the beginning and 98.8MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.74ms. Allocated memory is still 142.6MB. Free memory was 98.8MB in the beginning and 97.9MB in the end (delta: 945.7kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.34ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 96.8MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 278.42ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 82.1MB in the end (delta: 14.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 86127.65ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 82.1MB in the beginning and 52.9MB in the end (delta: 29.2MB). Peak memory consumption was 64.5MB. Max. memory is 16.1GB. * Witness Printer took 95.74ms. Allocated memory is still 176.2MB. Free memory was 52.9MB in the beginning and 139.6MB in the end (delta: -86.7MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: 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: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 67 edges, 22 error locations. Started 1 CEGAR loops. OverallTime: 61.6s, OverallIterations: 20, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 626 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 616 mSDsluCounter, 1833 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 45 IncrementalHoareTripleChecker+Unchecked, 1201 mSDsCounter, 99 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1941 IncrementalHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 99 mSolverCounterUnsat, 632 mSDtfsCounter, 1941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1558 GetRequests, 1363 SyntacticMatches, 2 SemanticMatches, 193 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 34.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=16, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 20 MinimizatonAttempts, 78 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 29.8s InterpolantComputationTime, 2112 NumberOfCodeBlocks, 1712 NumberOfCodeBlocksAsserted, 67 NumberOfCheckSat, 2394 ConstructedInterpolants, 4 QuantifiedInterpolants, 10307 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1400 ConjunctsInSsa, 101 ConjunctsInUnsatCore, 39 InterpolantComputations, 12 PerfectInterpolantSequences, 3455/4895 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 22 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: ((((((((((((0 <= k) && (2 <= x)) && (2 <= c)) && (2 == y)) && (x <= 3)) && (k <= 5)) && (c <= 9223372036854775805)) || (((((0 <= k) && (c == 1)) && (x == 1)) && (k <= 5)) && (y == 1))) || (((((((0 <= k) && (y == 4)) && (c <= 9223372036854775806)) && (x <= 10)) && (k <= 5)) && (4 <= c)) && (4 <= x))) || (((((0 <= k) && (c == 0)) && (y == 0)) && (k <= 5)) && (x == 0))) || (((((((((0 <= k) && (c <= 9223372036854775806)) && (1 <= y)) && ((((y + ((__int128) y * y)) >= 0) ? ((y + ((__int128) y * y)) % 2) : (((y + ((__int128) y * y)) % 2) + 2)) == 0)) && (x <= (y + (((((__int128) -1 * y) + ((__int128) y * y)) >= 0) ? ((((__int128) -1 * y) + ((__int128) y * y)) / 2) : (((((__int128) -1 * y) + ((__int128) y * y)) / 2) - 1))))) && (y <= x)) && (k <= 5)) && ((((__int128) y * 8) + ((__int128) y * y)) <= 9223372036854775791)) && (5 <= c))) || (((((((0 <= k) && (c <= 9223372036854775806)) && (3 == y)) && (k <= 5)) && (3 <= c)) && (x <= 6)) && (3 <= x))) RESULT: Ultimate proved your program to be correct! [2025-03-09 02:33:41,057 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