./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench/sqrt1-ll.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench/sqrt1-ll.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 5a667cf640b9cf5657756f4ca44157e13471ed71aebfaf7ff11f9d5251db37ae --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:50:52,754 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:50:52,808 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:50:52,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:50:52,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:50:52,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:50:52,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:50:52,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:50:52,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:50:52,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:50:52,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:50:52,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:50:52,838 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:50:52,838 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:50:52,838 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:50:52,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:50:52,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:50:52,838 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:50:52,839 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:50:52,839 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:50:52,840 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:50:52,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:50:52,840 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 -> 5a667cf640b9cf5657756f4ca44157e13471ed71aebfaf7ff11f9d5251db37ae [2025-03-04 10:50:53,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:50:53,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:50:53,064 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:50:53,066 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:50:53,066 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:50:53,066 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench/sqrt1-ll.c [2025-03-04 10:50:54,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d104d9a31/6f8aab299aec482496a871557d9478be/FLAG06250bad4 [2025-03-04 10:50:54,406 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:50:54,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench/sqrt1-ll.c [2025-03-04 10:50:54,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d104d9a31/6f8aab299aec482496a871557d9478be/FLAG06250bad4 [2025-03-04 10:50:54,425 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d104d9a31/6f8aab299aec482496a871557d9478be [2025-03-04 10:50:54,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:50:54,428 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:50:54,429 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:50:54,429 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:50:54,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:50:54,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54, skipping insertion in model container [2025-03-04 10:50:54,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,444 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:50:54,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:50:54,564 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:50:54,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:50:54,590 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:50:54,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54 WrapperNode [2025-03-04 10:50:54,591 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:50:54,592 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:50:54,592 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:50:54,592 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:50:54,596 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,612 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2025-03-04 10:50:54,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:50:54,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:50:54,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:50:54,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:50:54,620 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,620 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,621 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,627 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:50:54,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,629 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,630 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:50:54,632 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:50:54,632 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:50:54,632 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:50:54,633 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (1/1) ... [2025-03-04 10:50:54,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:50:54,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:50:54,659 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:50:54,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:50:54,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:50:54,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:50:54,677 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:50:54,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:50:54,677 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:50:54,677 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:50:54,716 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:50:54,717 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:50:54,991 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-03-04 10:50:54,992 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:50:55,002 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:50:55,003 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:50:55,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:50:55 BoogieIcfgContainer [2025-03-04 10:50:55,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:50:55,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:50:55,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:50:55,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:50:55,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:50:54" (1/3) ... [2025-03-04 10:50:55,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465c3985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:50:55, skipping insertion in model container [2025-03-04 10:50:55,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:50:54" (2/3) ... [2025-03-04 10:50:55,008 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@465c3985 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:50:55, skipping insertion in model container [2025-03-04 10:50:55,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:50:55" (3/3) ... [2025-03-04 10:50:55,009 INFO L128 eAbstractionObserver]: Analyzing ICFG sqrt1-ll.c [2025-03-04 10:50:55,018 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:50:55,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sqrt1-ll.c that has 2 procedures, 119 locations, 1 initial locations, 1 loop locations, and 50 error locations. [2025-03-04 10:50:55,058 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:50:55,064 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;@5288b38b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:50:55,064 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2025-03-04 10:50:55,067 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 111 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:50:55,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 10:50:55,069 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:55,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 10:50:55,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:55,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash 141966, now seen corresponding path program 1 times [2025-03-04 10:50:55,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:55,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94801541] [2025-03-04 10:50:55,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:55,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:55,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 10:50:55,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 10:50:55,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:55,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:55,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:50:55,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:55,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94801541] [2025-03-04 10:50:55,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94801541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:50:55,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:50:55,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:50:55,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527042550] [2025-03-04 10:50:55,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:50:55,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:50:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:55,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:50:55,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:50:55,210 INFO L87 Difference]: Start difference. First operand has 119 states, 61 states have (on average 1.8688524590163935) internal successors, (114), 111 states have internal predecessors, (114), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:50:55,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:55,339 INFO L93 Difference]: Finished difference Result 308 states and 370 transitions. [2025-03-04 10:50:55,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:50:55,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 10:50:55,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:55,347 INFO L225 Difference]: With dead ends: 308 [2025-03-04 10:50:55,347 INFO L226 Difference]: Without dead ends: 182 [2025-03-04 10:50:55,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:50:55,353 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 70 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:55,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 172 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-04 10:50:55,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 147. [2025-03-04 10:50:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 91 states have (on average 1.6373626373626373) internal successors, (149), 136 states have internal predecessors, (149), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 10:50:55,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 167 transitions. [2025-03-04 10:50:55,398 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 167 transitions. Word has length 3 [2025-03-04 10:50:55,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:55,398 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 167 transitions. [2025-03-04 10:50:55,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:50:55,398 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 167 transitions. [2025-03-04 10:50:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 10:50:55,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:55,400 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] [2025-03-04 10:50:55,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:50:55,400 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:55,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:55,401 INFO L85 PathProgramCache]: Analyzing trace with hash 333948797, now seen corresponding path program 1 times [2025-03-04 10:50:55,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:55,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-03-04 10:50:55,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:55,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:55,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:50:55,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:50:55,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:55,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:50:55,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1394834770] [2025-03-04 10:50:55,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:55,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:55,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:50:55,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:50:55,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:50:55,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 10:50:55,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 10:50:55,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:55,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:55,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:50:55,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:50:55,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:50:55,513 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:50:55,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:55,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-03-04 10:50:55,515 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:50:55,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394834770] [2025-03-04 10:50:55,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394834770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:50:55,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:50:55,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:50:55,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886300119] [2025-03-04 10:50:55,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:50:55,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:50:55,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:55,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:50:55,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:50:55,517 INFO L87 Difference]: Start difference. First operand 147 states and 167 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:50:55,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:55,610 INFO L93 Difference]: Finished difference Result 174 states and 195 transitions. [2025-03-04 10:50:55,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:50:55,611 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2025-03-04 10:50:55,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:55,612 INFO L225 Difference]: With dead ends: 174 [2025-03-04 10:50:55,612 INFO L226 Difference]: Without dead ends: 166 [2025-03-04 10:50:55,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:50:55,613 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:55,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 145 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:55,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-03-04 10:50:55,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 158. [2025-03-04 10:50:55,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 101 states have (on average 1.5841584158415842) internal successors, (160), 146 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-04 10:50:55,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 180 transitions. [2025-03-04 10:50:55,625 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 180 transitions. Word has length 24 [2025-03-04 10:50:55,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:55,625 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 180 transitions. [2025-03-04 10:50:55,625 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, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:50:55,625 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 180 transitions. [2025-03-04 10:50:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:50:55,626 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:55,626 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:55,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:50:55,830 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-04 10:50:55,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:55,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:55,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1762478168, now seen corresponding path program 1 times [2025-03-04 10:50:55,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:55,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028421535] [2025-03-04 10:50:55,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:55,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:55,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:50:55,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:50:55,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:55,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:50:55,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:55,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028421535] [2025-03-04 10:50:55,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028421535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:50:55,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:50:55,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:50:55,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745754146] [2025-03-04 10:50:55,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:50:55,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:50:55,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:55,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:50:55,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:50:55,893 INFO L87 Difference]: Start difference. First operand 158 states and 180 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:50:55,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:55,982 INFO L93 Difference]: Finished difference Result 174 states and 191 transitions. [2025-03-04 10:50:55,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:50:55,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2025-03-04 10:50:55,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:55,984 INFO L225 Difference]: With dead ends: 174 [2025-03-04 10:50:55,985 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 10:50:55,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:50:55,986 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 38 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:55,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 159 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 10:50:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-04 10:50:55,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 104 states have (on average 1.5) internal successors, (156), 149 states have internal predecessors, (156), 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-04 10:50:55,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 176 transitions. [2025-03-04 10:50:56,002 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 176 transitions. Word has length 25 [2025-03-04 10:50:56,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:56,003 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 176 transitions. [2025-03-04 10:50:56,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:50:56,003 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 176 transitions. [2025-03-04 10:50:56,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:50:56,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:56,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:56,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:50:56,004 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:56,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:56,004 INFO L85 PathProgramCache]: Analyzing trace with hash 11959865, now seen corresponding path program 1 times [2025-03-04 10:50:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90541645] [2025-03-04 10:50:56,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:56,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:50:56,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:50:56,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:56,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:56,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:50:56,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:56,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90541645] [2025-03-04 10:50:56,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90541645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:50:56,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:50:56,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:50:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193700913] [2025-03-04 10:50:56,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:50:56,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:50:56,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:56,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:50:56,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:50:56,116 INFO L87 Difference]: Start difference. First operand 161 states and 176 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:50:56,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:56,234 INFO L93 Difference]: Finished difference Result 166 states and 181 transitions. [2025-03-04 10:50:56,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:50:56,235 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2025-03-04 10:50:56,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:56,236 INFO L225 Difference]: With dead ends: 166 [2025-03-04 10:50:56,236 INFO L226 Difference]: Without dead ends: 164 [2025-03-04 10:50:56,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:50:56,237 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 46 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:56,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 207 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:56,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-04 10:50:56,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2025-03-04 10:50:56,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 149 states have internal predecessors, (154), 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-04 10:50:56,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 174 transitions. [2025-03-04 10:50:56,250 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 174 transitions. Word has length 28 [2025-03-04 10:50:56,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:56,250 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 174 transitions. [2025-03-04 10:50:56,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:50:56,250 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 174 transitions. [2025-03-04 10:50:56,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 10:50:56,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:56,251 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:56,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:50:56,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:56,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:56,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1468017419, now seen corresponding path program 1 times [2025-03-04 10:50:56,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:56,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917970624] [2025-03-04 10:50:56,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:56,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:56,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 10:50:56,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 10:50:56,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:56,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 10:50:56,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:56,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917970624] [2025-03-04 10:50:56,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917970624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:50:56,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:50:56,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:50:56,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76583777] [2025-03-04 10:50:56,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:50:56,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:50:56,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:56,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:50:56,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:50:56,345 INFO L87 Difference]: Start difference. First operand 161 states and 174 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:50:56,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:56,431 INFO L93 Difference]: Finished difference Result 166 states and 175 transitions. [2025-03-04 10:50:56,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:50:56,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2025-03-04 10:50:56,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:56,432 INFO L225 Difference]: With dead ends: 166 [2025-03-04 10:50:56,432 INFO L226 Difference]: Without dead ends: 138 [2025-03-04 10:50:56,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:50:56,433 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 29 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:56,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 141 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:56,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-04 10:50:56,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-04 10:50:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 83 states have (on average 1.5542168674698795) internal successors, (129), 128 states have internal predecessors, (129), 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-04 10:50:56,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2025-03-04 10:50:56,441 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 32 [2025-03-04 10:50:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:56,441 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2025-03-04 10:50:56,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:50:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2025-03-04 10:50:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 10:50:56,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:56,448 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:56,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:50:56,448 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:56,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:56,448 INFO L85 PathProgramCache]: Analyzing trace with hash 123381486, now seen corresponding path program 1 times [2025-03-04 10:50:56,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:56,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132082492] [2025-03-04 10:50:56,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:56,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:50:56,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:50:56,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:56,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:56,547 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:50:56,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:56,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132082492] [2025-03-04 10:50:56,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132082492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:50:56,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:50:56,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:50:56,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423541468] [2025-03-04 10:50:56,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:50:56,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:50:56,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:56,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:50:56,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:50:56,549 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:50:56,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:56,639 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2025-03-04 10:50:56,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:50:56,639 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-04 10:50:56,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:56,640 INFO L225 Difference]: With dead ends: 141 [2025-03-04 10:50:56,640 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 10:50:56,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:50:56,641 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 1 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:56,641 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 203 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:56,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 10:50:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2025-03-04 10:50:56,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 84 states have (on average 1.5476190476190477) internal successors, (130), 129 states have internal predecessors, (130), 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-04 10:50:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 146 transitions. [2025-03-04 10:50:56,648 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 146 transitions. Word has length 45 [2025-03-04 10:50:56,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:56,648 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 146 transitions. [2025-03-04 10:50:56,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:50:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 146 transitions. [2025-03-04 10:50:56,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 10:50:56,650 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:56,650 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:56,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:50:56,651 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:56,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -470141210, now seen corresponding path program 1 times [2025-03-04 10:50:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:56,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758860404] [2025-03-04 10:50:56,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:56,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:56,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 10:50:56,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 10:50:56,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:56,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:56,744 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:50:56,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:56,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758860404] [2025-03-04 10:50:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758860404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:50:56,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:50:56,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:50:56,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823411109] [2025-03-04 10:50:56,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:50:56,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:50:56,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:56,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:50:56,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:50:56,746 INFO L87 Difference]: Start difference. First operand 139 states and 146 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:50:56,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:56,812 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2025-03-04 10:50:56,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:50:56,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 46 [2025-03-04 10:50:56,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:56,814 INFO L225 Difference]: With dead ends: 141 [2025-03-04 10:50:56,814 INFO L226 Difference]: Without dead ends: 140 [2025-03-04 10:50:56,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:50:56,814 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:56,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 151 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-03-04 10:50:56,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-03-04 10:50:56,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 85 states have (on average 1.5411764705882354) internal successors, (131), 130 states have internal predecessors, (131), 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-04 10:50:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 147 transitions. [2025-03-04 10:50:56,819 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 147 transitions. Word has length 46 [2025-03-04 10:50:56,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:56,819 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 147 transitions. [2025-03-04 10:50:56,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:50:56,819 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2025-03-04 10:50:56,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 10:50:56,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:56,820 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:56,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:50:56,820 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:56,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:56,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1689475543, now seen corresponding path program 1 times [2025-03-04 10:50:56,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:56,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055859178] [2025-03-04 10:50:56,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:56,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:56,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:50:56,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:50:56,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:56,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:56,856 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:50:56,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055859178] [2025-03-04 10:50:56,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055859178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:50:56,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827814858] [2025-03-04 10:50:56,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:56,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:56,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:50:56,859 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:50:56,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:50:56,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 10:50:56,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 10:50:56,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:56,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:56,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:50:56,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:50:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:50:56,965 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:50:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827814858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:50:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:50:56,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:50:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006105719] [2025-03-04 10:50:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:50:56,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:50:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:56,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:50:56,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:50:56,966 INFO L87 Difference]: Start difference. First operand 140 states and 147 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:50:57,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:57,044 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2025-03-04 10:50:57,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:50:57,044 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 47 [2025-03-04 10:50:57,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:57,045 INFO L225 Difference]: With dead ends: 140 [2025-03-04 10:50:57,045 INFO L226 Difference]: Without dead ends: 131 [2025-03-04 10:50:57,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:50:57,045 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 120 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:57,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 114 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:57,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-04 10:50:57,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2025-03-04 10:50:57,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 121 states have internal predecessors, (122), 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-04 10:50:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 138 transitions. [2025-03-04 10:50:57,049 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 138 transitions. Word has length 47 [2025-03-04 10:50:57,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:57,050 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 138 transitions. [2025-03-04 10:50:57,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:50:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 138 transitions. [2025-03-04 10:50:57,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:50:57,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:57,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:57,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:50:57,250 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-04 10:50:57,251 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:57,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:57,251 INFO L85 PathProgramCache]: Analyzing trace with hash -834134204, now seen corresponding path program 1 times [2025-03-04 10:50:57,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:57,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973727736] [2025-03-04 10:50:57,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:57,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:57,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:50:57,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:50:57,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:57,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:57,308 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:50:57,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973727736] [2025-03-04 10:50:57,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973727736] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:50:57,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400566477] [2025-03-04 10:50:57,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:57,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:57,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:50:57,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:50:57,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:50:57,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:50:57,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:50:57,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:57,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:57,347 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:50:57,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:50:57,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:50:57,399 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:50:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:50:57,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400566477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:50:57,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:50:57,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:50:57,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166021281] [2025-03-04 10:50:57,458 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:50:57,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:50:57,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:57,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:50:57,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:50:57,459 INFO L87 Difference]: Start difference. First operand 131 states and 138 transitions. Second operand has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:50:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:57,577 INFO L93 Difference]: Finished difference Result 224 states and 253 transitions. [2025-03-04 10:50:57,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:50:57,578 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 48 [2025-03-04 10:50:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:57,579 INFO L225 Difference]: With dead ends: 224 [2025-03-04 10:50:57,580 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 10:50:57,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 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-04 10:50:57,581 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 175 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:57,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 261 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:57,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 10:50:57,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 122. [2025-03-04 10:50:57,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 112 states have internal predecessors, (113), 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-04 10:50:57,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 129 transitions. [2025-03-04 10:50:57,588 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 129 transitions. Word has length 48 [2025-03-04 10:50:57,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:57,588 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 129 transitions. [2025-03-04 10:50:57,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 7 states have internal predecessors, (94), 3 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-04 10:50:57,589 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 129 transitions. [2025-03-04 10:50:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 10:50:57,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:57,590 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:57,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:50:57,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:57,791 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:57,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:57,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1251325416, now seen corresponding path program 1 times [2025-03-04 10:50:57,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:57,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810762892] [2025-03-04 10:50:57,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:57,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:57,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:50:57,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:50:57,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:57,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:50:57,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1070261318] [2025-03-04 10:50:57,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:57,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:57,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:50:57,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:50:57,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:50:57,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 10:50:57,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 10:50:57,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:57,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:57,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:50:57,842 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:50:57,896 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:50:57,896 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:50:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:50:58,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:58,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810762892] [2025-03-04 10:50:58,007 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:50:58,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070261318] [2025-03-04 10:50:58,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070261318] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:50:58,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:50:58,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 10:50:58,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516478184] [2025-03-04 10:50:58,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:50:58,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:50:58,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:58,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:50:58,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:50:58,008 INFO L87 Difference]: Start difference. First operand 122 states and 129 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:50:58,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:58,144 INFO L93 Difference]: Finished difference Result 298 states and 320 transitions. [2025-03-04 10:50:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:50:58,145 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 61 [2025-03-04 10:50:58,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:58,146 INFO L225 Difference]: With dead ends: 298 [2025-03-04 10:50:58,146 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 10:50:58,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:50:58,146 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 281 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:58,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 288 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:58,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 10:50:58,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 196. [2025-03-04 10:50:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 153 states have (on average 1.3856209150326797) internal successors, (212), 179 states have internal predecessors, (212), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:50:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 242 transitions. [2025-03-04 10:50:58,158 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 242 transitions. Word has length 61 [2025-03-04 10:50:58,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:58,158 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 242 transitions. [2025-03-04 10:50:58,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 4 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 10:50:58,159 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 242 transitions. [2025-03-04 10:50:58,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 10:50:58,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:58,161 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:58,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 10:50:58,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:58,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:58,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:58,363 INFO L85 PathProgramCache]: Analyzing trace with hash -25163070, now seen corresponding path program 1 times [2025-03-04 10:50:58,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:58,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110527531] [2025-03-04 10:50:58,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:58,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:58,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 10:50:58,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:50:58,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:58,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:50:58,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578157190] [2025-03-04 10:50:58,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:58,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:58,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:50:58,382 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:50:58,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:50:58,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 10:50:58,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 10:50:58,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:58,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:58,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:50:58,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:50:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:50:58,468 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:50:58,566 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:50:58,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110527531] [2025-03-04 10:50:58,566 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:50:58,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578157190] [2025-03-04 10:50:58,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578157190] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:50:58,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:50:58,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 10:50:58,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104895249] [2025-03-04 10:50:58,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:50:58,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:50:58,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:58,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:50:58,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:50:58,567 INFO L87 Difference]: Start difference. First operand 196 states and 242 transitions. Second operand has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 10:50:58,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:58,753 INFO L93 Difference]: Finished difference Result 256 states and 319 transitions. [2025-03-04 10:50:58,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:50:58,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 68 [2025-03-04 10:50:58,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:58,754 INFO L225 Difference]: With dead ends: 256 [2025-03-04 10:50:58,754 INFO L226 Difference]: Without dead ends: 248 [2025-03-04 10:50:58,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:50:58,755 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 151 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:58,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 217 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:50:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-04 10:50:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 192. [2025-03-04 10:50:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 155 states have (on average 1.270967741935484) internal successors, (197), 174 states have internal predecessors, (197), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 10:50:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 229 transitions. [2025-03-04 10:50:58,765 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 229 transitions. Word has length 68 [2025-03-04 10:50:58,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:58,766 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 229 transitions. [2025-03-04 10:50:58,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.6) internal successors, (88), 6 states have internal predecessors, (88), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 10:50:58,766 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 229 transitions. [2025-03-04 10:50:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 10:50:58,766 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:58,766 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:58,772 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:50:58,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 10:50:58,967 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:58,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:58,968 INFO L85 PathProgramCache]: Analyzing trace with hash -780055117, now seen corresponding path program 1 times [2025-03-04 10:50:58,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:58,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491387722] [2025-03-04 10:50:58,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:58,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:58,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:50:58,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:50:58,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:58,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:50:59,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:59,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491387722] [2025-03-04 10:50:59,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491387722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:50:59,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669064527] [2025-03-04 10:50:59,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:59,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:59,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:50:59,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:50:59,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:50:59,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 10:50:59,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 10:50:59,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:59,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:59,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:50:59,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:50:59,227 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:50:59,227 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:50:59,310 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:50:59,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1669064527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:50:59,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:50:59,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:50:59,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573800168] [2025-03-04 10:50:59,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:50:59,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:50:59,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:50:59,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:50:59,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:50:59,312 INFO L87 Difference]: Start difference. First operand 192 states and 229 transitions. Second operand has 10 states, 9 states have (on average 13.333333333333334) internal successors, (120), 10 states have internal predecessors, (120), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 10:50:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:50:59,462 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2025-03-04 10:50:59,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:50:59,463 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.333333333333334) internal successors, (120), 10 states have internal predecessors, (120), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 69 [2025-03-04 10:50:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:50:59,464 INFO L225 Difference]: With dead ends: 192 [2025-03-04 10:50:59,464 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 10:50:59,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 132 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-04 10:50:59,465 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 159 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:50:59,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 174 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:50:59,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 10:50:59,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2025-03-04 10:50:59,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 155 states have (on average 1.2258064516129032) internal successors, (190), 171 states have internal predecessors, (190), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 10:50:59,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 222 transitions. [2025-03-04 10:50:59,473 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 222 transitions. Word has length 69 [2025-03-04 10:50:59,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:50:59,474 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 222 transitions. [2025-03-04 10:50:59,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.333333333333334) internal successors, (120), 10 states have internal predecessors, (120), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 10:50:59,474 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 222 transitions. [2025-03-04 10:50:59,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 10:50:59,475 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:50:59,475 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:50:59,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:50:59,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:59,675 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:50:59,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:50:59,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1588095200, now seen corresponding path program 1 times [2025-03-04 10:50:59,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:50:59,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-03-04 10:50:59,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:59,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:50:59,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:50:59,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:50:59,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:59,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:50:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:50:59,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-03-04 10:50:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724961754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:50:59,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683958304] [2025-03-04 10:50:59,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:50:59,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:50:59,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:50:59,762 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:50:59,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:50:59,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 10:50:59,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 10:50:59,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:50:59,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:50:59,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:50:59,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:50:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:50:59,920 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:00,003 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:51:00,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683958304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:00,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:00,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 10:51:00,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310644518] [2025-03-04 10:51:00,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:00,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:51:00,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:00,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:51:00,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:51:00,006 INFO L87 Difference]: Start difference. First operand 189 states and 222 transitions. Second operand has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 10:51:00,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:00,185 INFO L93 Difference]: Finished difference Result 215 states and 254 transitions. [2025-03-04 10:51:00,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:51:00,185 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 70 [2025-03-04 10:51:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:00,186 INFO L225 Difference]: With dead ends: 215 [2025-03-04 10:51:00,186 INFO L226 Difference]: Without dead ends: 206 [2025-03-04 10:51:00,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=72, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:00,187 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 155 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:00,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 195 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:00,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-04 10:51:00,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2025-03-04 10:51:00,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 155 states have (on average 1.1225806451612903) internal successors, (174), 164 states have internal predecessors, (174), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-04 10:51:00,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 206 transitions. [2025-03-04 10:51:00,197 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 206 transitions. Word has length 70 [2025-03-04 10:51:00,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:00,197 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 206 transitions. [2025-03-04 10:51:00,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 13.555555555555555) internal successors, (122), 10 states have internal predecessors, (122), 5 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2025-03-04 10:51:00,197 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 206 transitions. [2025-03-04 10:51:00,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:51:00,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:00,199 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:00,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:00,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:00,401 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:51:00,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:00,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1446098686, now seen corresponding path program 1 times [2025-03-04 10:51:00,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:00,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894331538] [2025-03-04 10:51:00,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:00,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:00,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:51:00,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:51:00,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:00,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:51:00,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894331538] [2025-03-04 10:51:00,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894331538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:00,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287163388] [2025-03-04 10:51:00,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:00,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:00,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:00,488 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:00,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:51:00,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:51:00,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:51:00,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:00,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:00,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:51:00,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:00,690 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:51:00,690 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:00,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287163388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:00,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:51:00,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2025-03-04 10:51:00,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377232000] [2025-03-04 10:51:00,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:00,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:51:00,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:00,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:51:00,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:51:00,691 INFO L87 Difference]: Start difference. First operand 182 states and 206 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:51:00,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:00,763 INFO L93 Difference]: Finished difference Result 182 states and 206 transitions. [2025-03-04 10:51:00,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:51:00,763 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 72 [2025-03-04 10:51:00,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:00,764 INFO L225 Difference]: With dead ends: 182 [2025-03-04 10:51:00,764 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 10:51:00,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 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-04 10:51:00,765 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 101 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:00,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 103 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:51:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 10:51:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-04 10:51:00,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 133 states have (on average 1.037593984962406) internal successors, (138), 136 states have internal predecessors, (138), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 10:51:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 166 transitions. [2025-03-04 10:51:00,773 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 166 transitions. Word has length 72 [2025-03-04 10:51:00,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:00,773 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 166 transitions. [2025-03-04 10:51:00,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 6 states have internal predecessors, (50), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 10:51:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2025-03-04 10:51:00,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 10:51:00,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:00,774 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-04 10:51:00,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:51:00,975 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-04 10:51:00,975 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:51:00,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:00,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1825482352, now seen corresponding path program 1 times [2025-03-04 10:51:00,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:00,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455145418] [2025-03-04 10:51:00,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:00,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:00,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 10:51:00,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 10:51:00,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:00,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:51:01,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:01,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455145418] [2025-03-04 10:51:01,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455145418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:01,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636657564] [2025-03-04 10:51:01,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:51:01,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:01,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:01,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:01,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:51:01,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 10:51:01,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 10:51:01,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:51:01,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:01,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:51:01,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:01,415 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:51:01,415 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-04 10:51:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636657564] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:01,594 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:01,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2025-03-04 10:51:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087978850] [2025-03-04 10:51:01,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:01,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:51:01,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:01,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:51:01,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=236, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:51:01,596 INFO L87 Difference]: Start difference. First operand 152 states and 166 transitions. Second operand has 20 states, 19 states have (on average 14.105263157894736) internal successors, (268), 20 states have internal predecessors, (268), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 10:51:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:01,852 INFO L93 Difference]: Finished difference Result 237 states and 265 transitions. [2025-03-04 10:51:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 10:51:01,852 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 14.105263157894736) internal successors, (268), 20 states have internal predecessors, (268), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) Word has length 134 [2025-03-04 10:51:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:01,854 INFO L225 Difference]: With dead ends: 237 [2025-03-04 10:51:01,854 INFO L226 Difference]: Without dead ends: 236 [2025-03-04 10:51:01,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 255 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-04 10:51:01,855 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:01,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 209 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-03-04 10:51:01,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2025-03-04 10:51:01,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 208 states have (on average 1.0528846153846154) internal successors, (219), 211 states have internal predecessors, (219), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 10:51:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 261 transitions. [2025-03-04 10:51:01,867 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 261 transitions. Word has length 134 [2025-03-04 10:51:01,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:01,867 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 261 transitions. [2025-03-04 10:51:01,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 14.105263157894736) internal successors, (268), 20 states have internal predecessors, (268), 9 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 9 states have call predecessors, (27), 9 states have call successors, (27) [2025-03-04 10:51:01,867 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 261 transitions. [2025-03-04 10:51:01,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-04 10:51:01,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:01,869 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 10:51:01,875 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-04 10:51:02,069 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-04 10:51:02,069 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:51:02,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:02,070 INFO L85 PathProgramCache]: Analyzing trace with hash -555132310, now seen corresponding path program 2 times [2025-03-04 10:51:02,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:02,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305359743] [2025-03-04 10:51:02,070 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:51:02,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:02,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-04 10:51:02,091 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 10:51:02,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:51:02,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:02,247 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:51:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:02,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305359743] [2025-03-04 10:51:02,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305359743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:02,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1443790820] [2025-03-04 10:51:02,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:51:02,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:02,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:02,250 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:02,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:51:02,274 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 158 statements into 2 equivalence classes. [2025-03-04 10:51:02,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 158 of 158 statements. [2025-03-04 10:51:02,296 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:51:02,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:02,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:51:02,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:51:02,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:02,804 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:51:02,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1443790820] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:02,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:02,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-03-04 10:51:02,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95806922] [2025-03-04 10:51:02,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:02,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 10:51:02,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:02,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 10:51:02,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=297, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:51:02,806 INFO L87 Difference]: Start difference. First operand 234 states and 261 transitions. Second operand has 22 states, 21 states have (on average 14.095238095238095) internal successors, (296), 22 states have internal predecessors, (296), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 10:51:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:03,123 INFO L93 Difference]: Finished difference Result 255 states and 282 transitions. [2025-03-04 10:51:03,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:51:03,123 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 14.095238095238095) internal successors, (296), 22 states have internal predecessors, (296), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) Word has length 158 [2025-03-04 10:51:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:03,124 INFO L225 Difference]: With dead ends: 255 [2025-03-04 10:51:03,124 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 10:51:03,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=319, Invalid=551, Unknown=0, NotChecked=0, Total=870 [2025-03-04 10:51:03,125 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 75 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:03,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 278 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:03,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 10:51:03,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 250. [2025-03-04 10:51:03,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 222 states have (on average 1.045045045045045) internal successors, (232), 225 states have internal predecessors, (232), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-04 10:51:03,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 278 transitions. [2025-03-04 10:51:03,133 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 278 transitions. Word has length 158 [2025-03-04 10:51:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:03,134 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 278 transitions. [2025-03-04 10:51:03,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 14.095238095238095) internal successors, (296), 22 states have internal predecessors, (296), 11 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-03-04 10:51:03,134 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 278 transitions. [2025-03-04 10:51:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-03-04 10:51:03,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:03,135 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-04 10:51:03,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 10:51:03,335 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-04 10:51:03,336 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:51:03,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:03,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1833354247, now seen corresponding path program 2 times [2025-03-04 10:51:03,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:03,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997652178] [2025-03-04 10:51:03,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:51:03,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:03,342 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 193 statements into 2 equivalence classes. [2025-03-04 10:51:03,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 10:51:03,356 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:51:03,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:03,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [10230809] [2025-03-04 10:51:03,357 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:51:03,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:03,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:03,359 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:03,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:51:03,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 193 statements into 2 equivalence classes. [2025-03-04 10:51:03,409 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 193 of 193 statements. [2025-03-04 10:51:03,409 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:51:03,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:03,411 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:51:03,413 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:03,541 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:51:03,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:03,802 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 236 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-04 10:51:03,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997652178] [2025-03-04 10:51:03,802 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:03,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10230809] [2025-03-04 10:51:03,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10230809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:03,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:03,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 10:51:03,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352164108] [2025-03-04 10:51:03,802 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:03,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:51:03,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:03,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:51:03,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:03,804 INFO L87 Difference]: Start difference. First operand 250 states and 278 transitions. Second operand has 12 states, 11 states have (on average 23.454545454545453) internal successors, (258), 12 states have internal predecessors, (258), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 10:51:04,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:04,125 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2025-03-04 10:51:04,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:51:04,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.454545454545453) internal successors, (258), 12 states have internal predecessors, (258), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 193 [2025-03-04 10:51:04,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:04,127 INFO L225 Difference]: With dead ends: 352 [2025-03-04 10:51:04,127 INFO L226 Difference]: Without dead ends: 351 [2025-03-04 10:51:04,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 374 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-04 10:51:04,128 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 140 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:04,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 657 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:04,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-04 10:51:04,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 341. [2025-03-04 10:51:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 305 states have (on average 1.0459016393442624) internal successors, (319), 308 states have internal predecessors, (319), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 10:51:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 381 transitions. [2025-03-04 10:51:04,138 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 381 transitions. Word has length 193 [2025-03-04 10:51:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:04,139 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 381 transitions. [2025-03-04 10:51:04,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.454545454545453) internal successors, (258), 12 states have internal predecessors, (258), 10 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2025-03-04 10:51:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 381 transitions. [2025-03-04 10:51:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 10:51:04,140 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:04,140 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1] [2025-03-04 10:51:04,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:51:04,340 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-04 10:51:04,341 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:51:04,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:04,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1670529135, now seen corresponding path program 2 times [2025-03-04 10:51:04,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:04,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146613893] [2025-03-04 10:51:04,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:51:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:04,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-03-04 10:51:04,359 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 10:51:04,360 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:51:04,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:04,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828296663] [2025-03-04 10:51:04,361 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:51:04,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:04,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:04,362 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-04 10:51:04,364 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-04 10:51:04,384 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-03-04 10:51:04,416 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 10:51:04,416 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:51:04,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:04,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:51:04,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:51:04,543 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:04,795 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 248 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 10:51:04,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:04,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146613893] [2025-03-04 10:51:04,796 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:04,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828296663] [2025-03-04 10:51:04,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828296663] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:04,796 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:04,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-04 10:51:04,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338862228] [2025-03-04 10:51:04,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:04,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:51:04,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:04,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:51:04,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:51:04,797 INFO L87 Difference]: Start difference. First operand 341 states and 381 transitions. Second operand has 12 states, 11 states have (on average 23.818181818181817) internal successors, (262), 12 states have internal predecessors, (262), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-04 10:51:05,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:05,102 INFO L93 Difference]: Finished difference Result 347 states and 386 transitions. [2025-03-04 10:51:05,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 10:51:05,103 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 23.818181818181817) internal successors, (262), 12 states have internal predecessors, (262), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 200 [2025-03-04 10:51:05,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:05,104 INFO L225 Difference]: With dead ends: 347 [2025-03-04 10:51:05,104 INFO L226 Difference]: Without dead ends: 346 [2025-03-04 10:51:05,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 388 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-04 10:51:05,105 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 98 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:05,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 589 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:05,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-03-04 10:51:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2025-03-04 10:51:05,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 307 states have (on average 1.0293159609120521) internal successors, (316), 310 states have internal predecessors, (316), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 10:51:05,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 380 transitions. [2025-03-04 10:51:05,116 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 380 transitions. Word has length 200 [2025-03-04 10:51:05,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:05,116 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 380 transitions. [2025-03-04 10:51:05,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 23.818181818181817) internal successors, (262), 12 states have internal predecessors, (262), 10 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2025-03-04 10:51:05,116 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 380 transitions. [2025-03-04 10:51:05,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2025-03-04 10:51:05,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:05,118 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1] [2025-03-04 10:51:05,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:51:05,319 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-04 10:51:05,319 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:51:05,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:05,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1413276796, now seen corresponding path program 2 times [2025-03-04 10:51:05,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:05,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24393491] [2025-03-04 10:51:05,319 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:51:05,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:05,328 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 310 statements into 2 equivalence classes. [2025-03-04 10:51:05,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 10:51:05,337 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:51:05,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-03-04 10:51:05,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:05,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24393491] [2025-03-04 10:51:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24393491] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:05,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694379294] [2025-03-04 10:51:05,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:51:05,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:05,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:05,474 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-04 10:51:05,475 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-04 10:51:05,499 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 310 statements into 2 equivalence classes. [2025-03-04 10:51:05,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 310 of 310 statements. [2025-03-04 10:51:05,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:51:05,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:05,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:51:05,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 36 proven. 36 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-03-04 10:51:05,760 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 1440 trivial. 0 not checked. [2025-03-04 10:51:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694379294] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:51:06,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:51:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 10:51:06,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307481374] [2025-03-04 10:51:06,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:06,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 10:51:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 10:51:06,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:51:06,026 INFO L87 Difference]: Start difference. First operand 344 states and 380 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 10:51:06,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:06,102 INFO L93 Difference]: Finished difference Result 344 states and 380 transitions. [2025-03-04 10:51:06,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:51:06,102 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 310 [2025-03-04 10:51:06,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:06,104 INFO L225 Difference]: With dead ends: 344 [2025-03-04 10:51:06,104 INFO L226 Difference]: Without dead ends: 343 [2025-03-04 10:51:06,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 612 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2025-03-04 10:51:06,104 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 147 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:06,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 118 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:51:06,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-03-04 10:51:06,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2025-03-04 10:51:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 307 states have (on average 1.01628664495114) internal successors, (312), 309 states have internal predecessors, (312), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 10:51:06,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 376 transitions. [2025-03-04 10:51:06,116 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 376 transitions. Word has length 310 [2025-03-04 10:51:06,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:06,116 INFO L471 AbstractCegarLoop]: Abstraction has 343 states and 376 transitions. [2025-03-04 10:51:06,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 13 states have internal predecessors, (100), 5 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 10:51:06,117 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 376 transitions. [2025-03-04 10:51:06,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2025-03-04 10:51:06,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:06,119 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1] [2025-03-04 10:51:06,125 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-04 10:51:06,319 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-04 10:51:06,319 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:51:06,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash -388705410, now seen corresponding path program 3 times [2025-03-04 10:51:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:06,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566505377] [2025-03-04 10:51:06,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:51:06,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:06,330 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 334 statements into 13 equivalence classes. [2025-03-04 10:51:06,343 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 119 of 334 statements. [2025-03-04 10:51:06,345 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 10:51:06,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 51 proven. 414 refuted. 0 times theorem prover too weak. 1331 trivial. 0 not checked. [2025-03-04 10:51:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566505377] [2025-03-04 10:51:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566505377] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [327579884] [2025-03-04 10:51:06,518 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:51:06,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:06,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:06,520 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-04 10:51:06,522 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-04 10:51:06,550 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 334 statements into 13 equivalence classes. [2025-03-04 10:51:06,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 42 of 334 statements. [2025-03-04 10:51:06,559 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 10:51:06,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:06,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 10:51:06,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:06,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1796 backedges. 126 proven. 148 refuted. 0 times theorem prover too weak. 1522 trivial. 0 not checked. [2025-03-04 10:51:06,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:51:07,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [327579884] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:51:07,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:51:07,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 15 [2025-03-04 10:51:07,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485307148] [2025-03-04 10:51:07,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:51:07,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:51:07,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:07,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:51:07,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2025-03-04 10:51:07,255 INFO L87 Difference]: Start difference. First operand 343 states and 376 transitions. Second operand has 16 states, 15 states have (on average 8.0) internal successors, (120), 16 states have internal predecessors, (120), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 10:51:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:07,627 INFO L93 Difference]: Finished difference Result 343 states and 376 transitions. [2025-03-04 10:51:07,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:51:07,627 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 8.0) internal successors, (120), 16 states have internal predecessors, (120), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 334 [2025-03-04 10:51:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:07,629 INFO L225 Difference]: With dead ends: 343 [2025-03-04 10:51:07,629 INFO L226 Difference]: Without dead ends: 342 [2025-03-04 10:51:07,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2025-03-04 10:51:07,629 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 301 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:07,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 72 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:51:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2025-03-04 10:51:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2025-03-04 10:51:07,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 307 states have (on average 1.006514657980456) internal successors, (309), 308 states have internal predecessors, (309), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 10:51:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 373 transitions. [2025-03-04 10:51:07,649 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 373 transitions. Word has length 334 [2025-03-04 10:51:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:07,650 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 373 transitions. [2025-03-04 10:51:07,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 8.0) internal successors, (120), 16 states have internal predecessors, (120), 6 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 10:51:07,650 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 373 transitions. [2025-03-04 10:51:07,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2025-03-04 10:51:07,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:51:07,657 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1] [2025-03-04 10:51:07,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:07,857 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-04 10:51:07,857 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 47 more)] === [2025-03-04 10:51:07,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:51:07,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1156843163, now seen corresponding path program 3 times [2025-03-04 10:51:07,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:51:07,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311957702] [2025-03-04 10:51:07,858 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:51:07,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:51:07,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 457 statements into 16 equivalence classes. [2025-03-04 10:51:07,986 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 457 of 457 statements. [2025-03-04 10:51:07,987 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-04 10:51:07,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:51:07,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1566363766] [2025-03-04 10:51:07,988 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:51:07,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:07,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:51:07,990 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:51:07,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:51:08,025 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 457 statements into 16 equivalence classes. [2025-03-04 10:51:08,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 66 of 457 statements. [2025-03-04 10:51:08,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:51:08,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:51:08,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:51:08,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:51:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 3410 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 2982 trivial. 0 not checked. [2025-03-04 10:51:08,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:51:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:51:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311957702] [2025-03-04 10:51:08,237 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:51:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566363766] [2025-03-04 10:51:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566363766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:51:08,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:51:08,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 10:51:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159524967] [2025-03-04 10:51:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:51:08,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:51:08,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:51:08,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:51:08,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:51:08,238 INFO L87 Difference]: Start difference. First operand 342 states and 373 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:51:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:51:08,680 INFO L93 Difference]: Finished difference Result 342 states and 373 transitions. [2025-03-04 10:51:08,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:51:08,680 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 457 [2025-03-04 10:51:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:51:08,682 INFO L225 Difference]: With dead ends: 342 [2025-03-04 10:51:08,682 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:51:08,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 449 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:51:08,683 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 138 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:51:08,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 46 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:51:08,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:51:08,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:51:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:51:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:51:08,684 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 457 [2025-03-04 10:51:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:51:08,684 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:51:08,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 3 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:51:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:51:08,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:51:08,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 50 remaining) [2025-03-04 10:51:08,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 50 remaining) [2025-03-04 10:51:08,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 50 remaining) [2025-03-04 10:51:08,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 50 remaining) [2025-03-04 10:51:08,687 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 50 remaining) [2025-03-04 10:51:08,688 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 50 remaining) [2025-03-04 10:51:08,689 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 50 remaining) [2025-03-04 10:51:08,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 50 remaining) [2025-03-04 10:51:08,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 50 remaining) [2025-03-04 10:51:08,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 50 remaining) [2025-03-04 10:51:08,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 50 remaining) [2025-03-04 10:51:08,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 50 remaining) [2025-03-04 10:51:08,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 50 remaining) [2025-03-04 10:51:08,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 50 remaining) [2025-03-04 10:51:08,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 50 remaining) [2025-03-04 10:51:08,690 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 50 remaining) [2025-03-04 10:51:08,691 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 50 remaining) [2025-03-04 10:51:08,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:51:08,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:51:08,894 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:51:08,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:51:09,747 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:51:09,759 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:51:09 BoogieIcfgContainer [2025-03-04 10:51:09,759 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:51:09,759 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:51:09,759 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:51:09,760 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:51:09,763 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:50:55" (3/4) ... [2025-03-04 10:51:09,764 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:51:09,768 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:51:09,770 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 10:51:09,771 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:51:09,771 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:51:09,771 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:51:09,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:51:09,831 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:51:09,831 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:51:09,831 INFO L158 Benchmark]: Toolchain (without parser) took 15403.81ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 121.9MB in the beginning and 127.2MB in the end (delta: -5.3MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2025-03-04 10:51:09,832 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 192.9MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:51:09,832 INFO L158 Benchmark]: CACSL2BoogieTranslator took 162.82ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 110.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:51:09,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.24ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:51:09,832 INFO L158 Benchmark]: Boogie Preprocessor took 19.02ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 108.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:51:09,832 INFO L158 Benchmark]: IcfgBuilder took 371.15ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 89.7MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:51:09,832 INFO L158 Benchmark]: TraceAbstraction took 14754.21ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 89.2MB in the beginning and 135.4MB in the end (delta: -46.3MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. [2025-03-04 10:51:09,833 INFO L158 Benchmark]: Witness Printer took 71.57ms. Allocated memory is still 243.3MB. Free memory was 135.4MB in the beginning and 127.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:51:09,833 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.12ms. Allocated memory is still 192.9MB. Free memory is still 112.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 162.82ms. Allocated memory is still 167.8MB. Free memory was 121.6MB in the beginning and 110.8MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.24ms. Allocated memory is still 167.8MB. Free memory was 110.8MB in the beginning and 109.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.02ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 108.2MB in the end (delta: 1.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 371.15ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 89.7MB in the end (delta: 18.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14754.21ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 89.2MB in the beginning and 135.4MB in the end (delta: -46.3MB). Peak memory consumption was 94.1MB. Max. memory is 16.1GB. * Witness Printer took 71.57ms. Allocated memory is still 243.3MB. Free memory was 135.4MB in the beginning and 127.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 39]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 32]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 31]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 50 error locations. Started 1 CEGAR loops. OverallTime: 13.9s, OverallIterations: 21, TraceHistogramMax: 31, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2334 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2273 mSDsluCounter, 4499 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3094 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3576 IncrementalHoareTripleChecker+Invalid, 3884 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 1405 mSDtfsCounter, 3576 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3672 GetRequests, 3483 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=344occurred in iteration=18, InterpolantAutomatonStates: 147, 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, 21 MinimizatonAttempts, 341 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 4669 NumberOfCodeBlocks, 3771 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 4937 ConstructedInterpolants, 4 QuantifiedInterpolants, 18183 SizeOfPredicates, 11 NumberOfNonLiveVariables, 2577 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 40 InterpolantComputations, 10 PerfectInterpolantSequences, 13807/16405 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 50 specifications checked. All of them hold - InvariantResult [Line: 29]: Location Invariant Derived location invariant: (((((n <= 2147483647) && (t == 1)) && (a == 0)) && (s == 1)) || ((((((((n <= 2147483647) && (((((((__int128) t * t) + ((__int128) 2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) : ((((((__int128) t * t) + ((__int128) 2 * t)) + 1) % 4) + 4)) == 0)) && (((__int128) t + 1) <= s)) && (((((((__int128) t * t) + ((__int128) -2 * t)) + 1) >= 0) ? (((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) : ((((((__int128) t * t) + ((__int128) -2 * t)) + 1) / 4) - 1)) <= 2305843009213693951)) && (3 <= t)) && (1 <= a)) && (a <= 4611686018427387903)) && (s <= ((__int128) 2147483647 + t)))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:51:09,849 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