./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound5.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 d629f4eefc4b49512b7b1b628f28a13dcdca90b36cb521919e0cc9ad875c2764 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:21:33,689 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:21:33,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:21:33,738 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:21:33,738 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:21:33,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:21:33,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:21:33,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:21:33,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:21:33,765 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:21:33,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:21:33,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:21:33,766 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:21:33,766 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:21:33,766 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:21:33,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:21:33,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:21:33,766 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:21:33,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:21:33,768 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:21:33,768 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:21:33,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:21:33,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:21:33,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:21:33,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:21:33,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:21:33,769 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:21:33,769 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:21:33,769 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:21:33,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:21:33,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:21:33,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:21:33,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:21:33,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:21:33,769 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 -> d629f4eefc4b49512b7b1b628f28a13dcdca90b36cb521919e0cc9ad875c2764 [2025-03-04 11:21:33,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:21:33,975 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:21:33,977 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:21:33,978 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:21:33,978 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:21:33,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound5.c [2025-03-04 11:21:35,070 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57a487e0/56704eb8cb72495f8bde4761f6086e11/FLAG84da374c2 [2025-03-04 11:21:35,256 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:21:35,257 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/ps4-ll_unwindbound5.c [2025-03-04 11:21:35,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57a487e0/56704eb8cb72495f8bde4761f6086e11/FLAG84da374c2 [2025-03-04 11:21:35,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f57a487e0/56704eb8cb72495f8bde4761f6086e11 [2025-03-04 11:21:35,637 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:21:35,638 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:21:35,640 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:21:35,640 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:21:35,643 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:21:35,643 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,645 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@178c604e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35, skipping insertion in model container [2025-03-04 11:21:35,645 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,654 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:21:35,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:21:35,762 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:21:35,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:21:35,791 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:21:35,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35 WrapperNode [2025-03-04 11:21:35,792 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:21:35,793 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:21:35,793 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:21:35,793 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:21:35,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,802 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,814 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 106 [2025-03-04 11:21:35,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:21:35,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:21:35,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:21:35,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:21:35,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,830 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 11:21:35,830 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,831 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,832 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,833 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,833 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,834 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:21:35,836 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:21:35,836 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:21:35,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:21:35,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (1/1) ... [2025-03-04 11:21:35,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:21:35,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:35,859 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:21:35,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:21:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:21:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:21:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:21:35,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:21:35,878 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:21:35,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:21:35,913 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:21:35,915 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:21:36,260 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-04 11:21:36,260 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:21:36,271 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:21:36,271 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:21:36,271 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:21:36 BoogieIcfgContainer [2025-03-04 11:21:36,271 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:21:36,273 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:21:36,273 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:21:36,276 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:21:36,276 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:21:35" (1/3) ... [2025-03-04 11:21:36,277 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae13398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:21:36, skipping insertion in model container [2025-03-04 11:21:36,277 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:21:35" (2/3) ... [2025-03-04 11:21:36,278 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ae13398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:21:36, skipping insertion in model container [2025-03-04 11:21:36,278 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:21:36" (3/3) ... [2025-03-04 11:21:36,279 INFO L128 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound5.c [2025-03-04 11:21:36,290 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:21:36,291 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ps4-ll_unwindbound5.c that has 2 procedures, 142 locations, 1 initial locations, 1 loop locations, and 62 error locations. [2025-03-04 11:21:36,328 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:21:36,338 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;@2c38dbfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:21:36,338 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2025-03-04 11:21:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand has 142 states, 75 states have (on average 1.88) internal successors, (141), 137 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:21:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 11:21:36,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:36,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 11:21:36,345 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:36,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:36,349 INFO L85 PathProgramCache]: Analyzing trace with hash 5139871, now seen corresponding path program 1 times [2025-03-04 11:21:36,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:36,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287986576] [2025-03-04 11:21:36,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:36,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:36,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 11:21:36,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 11:21:36,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:36,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:36,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287986576] [2025-03-04 11:21:36,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287986576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:36,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:36,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:21:36,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689507129] [2025-03-04 11:21:36,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:36,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:21:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:36,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:21:36,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:36,517 INFO L87 Difference]: Start difference. First operand has 142 states, 75 states have (on average 1.88) internal successors, (141), 137 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:21:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:36,588 INFO L93 Difference]: Finished difference Result 275 states and 302 transitions. [2025-03-04 11:21:36,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:21:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 11:21:36,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:36,594 INFO L225 Difference]: With dead ends: 275 [2025-03-04 11:21:36,594 INFO L226 Difference]: Without dead ends: 129 [2025-03-04 11:21:36,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:21:36,601 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 4 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:36,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 384 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:21:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2025-03-04 11:21:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2025-03-04 11:21:36,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 74 states have (on average 1.7162162162162162) internal successors, (127), 125 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:36,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 131 transitions. [2025-03-04 11:21:36,638 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 131 transitions. Word has length 4 [2025-03-04 11:21:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:36,638 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 131 transitions. [2025-03-04 11:21:36,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:21:36,639 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 131 transitions. [2025-03-04 11:21:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 11:21:36,639 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:36,639 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:36,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:21:36,640 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:36,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:36,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1496826461, now seen corresponding path program 1 times [2025-03-04 11:21:36,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:36,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641264395] [2025-03-04 11:21:36,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:36,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:36,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 11:21:36,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 11:21:36,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:36,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:36,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:36,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:36,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641264395] [2025-03-04 11:21:36,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641264395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:36,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:36,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:21:36,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230437515] [2025-03-04 11:21:36,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:36,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:21:36,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:36,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:21:36,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:21:36,694 INFO L87 Difference]: Start difference. First operand 129 states and 131 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:21:36,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:36,795 INFO L93 Difference]: Finished difference Result 234 states and 246 transitions. [2025-03-04 11:21:36,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:21:36,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 11:21:36,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:36,797 INFO L225 Difference]: With dead ends: 234 [2025-03-04 11:21:36,797 INFO L226 Difference]: Without dead ends: 223 [2025-03-04 11:21:36,797 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:21:36,798 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 92 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:36,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 193 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:21:36,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-03-04 11:21:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 181. [2025-03-04 11:21:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 124 states have (on average 1.6774193548387097) internal successors, (208), 175 states have internal predecessors, (208), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:21:36,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 216 transitions. [2025-03-04 11:21:36,808 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 216 transitions. Word has length 7 [2025-03-04 11:21:36,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:36,808 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 216 transitions. [2025-03-04 11:21:36,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:21:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 216 transitions. [2025-03-04 11:21:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 11:21:36,808 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:36,808 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:36,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:21:36,809 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:36,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:36,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1606539303, now seen corresponding path program 1 times [2025-03-04 11:21:36,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:36,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757576518] [2025-03-04 11:21:36,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:36,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:36,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:21:36,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:21:36,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:36,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:36,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [391148325] [2025-03-04 11:21:36,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:36,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:36,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:36,823 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:36,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:21:36,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 11:21:36,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 11:21:36,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:36,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:36,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:21:36,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:36,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:36,893 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:21:36,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:36,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757576518] [2025-03-04 11:21:36,894 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:36,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391148325] [2025-03-04 11:21:36,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391148325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:36,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:36,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:21:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058845674] [2025-03-04 11:21:36,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:36,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:21:36,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:36,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:21:36,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:21:36,897 INFO L87 Difference]: Start difference. First operand 181 states and 216 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:21:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:37,081 INFO L93 Difference]: Finished difference Result 214 states and 224 transitions. [2025-03-04 11:21:37,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:21:37,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2025-03-04 11:21:37,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:37,083 INFO L225 Difference]: With dead ends: 214 [2025-03-04 11:21:37,086 INFO L226 Difference]: Without dead ends: 187 [2025-03-04 11:21:37,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:21:37,087 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:37,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 104 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:21:37,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-04 11:21:37,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2025-03-04 11:21:37,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 128 states have (on average 1.4765625) internal successors, (189), 179 states have internal predecessors, (189), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:21:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 197 transitions. [2025-03-04 11:21:37,097 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 197 transitions. Word has length 10 [2025-03-04 11:21:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:37,097 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 197 transitions. [2025-03-04 11:21:37,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:21:37,097 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 197 transitions. [2025-03-04 11:21:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 11:21:37,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:37,098 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:37,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:37,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:37,299 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:37,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:37,299 INFO L85 PathProgramCache]: Analyzing trace with hash -624014949, now seen corresponding path program 1 times [2025-03-04 11:21:37,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:37,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247915761] [2025-03-04 11:21:37,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:37,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:37,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 11:21:37,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 11:21:37,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:37,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:37,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:37,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:37,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247915761] [2025-03-04 11:21:37,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247915761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:37,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:37,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:21:37,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059315488] [2025-03-04 11:21:37,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:37,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:21:37,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:37,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:21:37,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:37,367 INFO L87 Difference]: Start difference. First operand 185 states and 197 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:21:37,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:37,486 INFO L93 Difference]: Finished difference Result 202 states and 208 transitions. [2025-03-04 11:21:37,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:21:37,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 11:21:37,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:37,488 INFO L225 Difference]: With dead ends: 202 [2025-03-04 11:21:37,488 INFO L226 Difference]: Without dead ends: 168 [2025-03-04 11:21:37,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:37,488 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 114 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:37,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 164 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:21:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-04 11:21:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2025-03-04 11:21:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5445544554455446) internal successors, (156), 152 states have internal predecessors, (156), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:21:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 162 transitions. [2025-03-04 11:21:37,499 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 162 transitions. Word has length 15 [2025-03-04 11:21:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:37,499 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 162 transitions. [2025-03-04 11:21:37,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:21:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 162 transitions. [2025-03-04 11:21:37,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:21:37,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:37,500 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:37,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:21:37,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:37,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:37,500 INFO L85 PathProgramCache]: Analyzing trace with hash 72446130, now seen corresponding path program 1 times [2025-03-04 11:21:37,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:37,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901580916] [2025-03-04 11:21:37,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:37,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:37,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:21:37,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:21:37,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:37,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:37,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:37,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:37,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901580916] [2025-03-04 11:21:37,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901580916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:37,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:37,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:21:37,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286887307] [2025-03-04 11:21:37,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:37,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:21:37,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:37,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:21:37,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:21:37,571 INFO L87 Difference]: Start difference. First operand 157 states and 162 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:37,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:37,586 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2025-03-04 11:21:37,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:21:37,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2025-03-04 11:21:37,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:37,587 INFO L225 Difference]: With dead ends: 159 [2025-03-04 11:21:37,588 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 11:21:37,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:21:37,588 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:37,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 244 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:21:37,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 11:21:37,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 11:21:37,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 101 states have (on average 1.5247524752475248) internal successors, (154), 152 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:21:37,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 160 transitions. [2025-03-04 11:21:37,598 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 160 transitions. Word has length 35 [2025-03-04 11:21:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:37,599 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 160 transitions. [2025-03-04 11:21:37,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 160 transitions. [2025-03-04 11:21:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 11:21:37,600 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:37,600 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:37,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:21:37,600 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:37,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:37,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1467914873, now seen corresponding path program 1 times [2025-03-04 11:21:37,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:37,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901843864] [2025-03-04 11:21:37,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:37,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:37,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:21:37,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:21:37,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:37,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:37,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1986820241] [2025-03-04 11:21:37,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:37,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:37,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:37,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:37,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:21:37,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 11:21:37,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 11:21:37,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:37,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:37,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:21:37,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:37,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:37,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:21:37,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901843864] [2025-03-04 11:21:37,715 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:37,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1986820241] [2025-03-04 11:21:37,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1986820241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:37,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:37,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:21:37,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784974928] [2025-03-04 11:21:37,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:37,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:21:37,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:37,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:21:37,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:37,716 INFO L87 Difference]: Start difference. First operand 157 states and 160 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:37,917 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2025-03-04 11:21:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:21:37,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2025-03-04 11:21:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:37,918 INFO L225 Difference]: With dead ends: 258 [2025-03-04 11:21:37,918 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 11:21:37,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:37,919 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 72 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:37,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 124 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:21:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 11:21:37,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 222. [2025-03-04 11:21:37,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.4817073170731707) internal successors, (243), 215 states have internal predecessors, (243), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:37,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 253 transitions. [2025-03-04 11:21:37,943 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 253 transitions. Word has length 40 [2025-03-04 11:21:37,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:37,943 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 253 transitions. [2025-03-04 11:21:37,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:37,943 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 253 transitions. [2025-03-04 11:21:37,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 11:21:37,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:37,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:37,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:38,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 11:21:38,145 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:38,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:38,145 INFO L85 PathProgramCache]: Analyzing trace with hash -704989654, now seen corresponding path program 1 times [2025-03-04 11:21:38,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:38,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445420845] [2025-03-04 11:21:38,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:38,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:38,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 11:21:38,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 11:21:38,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:38,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:38,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:38,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:38,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445420845] [2025-03-04 11:21:38,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445420845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:38,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:38,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:21:38,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826112508] [2025-03-04 11:21:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:38,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:21:38,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:38,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:21:38,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:38,244 INFO L87 Difference]: Start difference. First operand 222 states and 253 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:38,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:38,415 INFO L93 Difference]: Finished difference Result 223 states and 253 transitions. [2025-03-04 11:21:38,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:21:38,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2025-03-04 11:21:38,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:38,417 INFO L225 Difference]: With dead ends: 223 [2025-03-04 11:21:38,417 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 11:21:38,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:38,417 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 33 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:38,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 208 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:21:38,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 11:21:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-04 11:21:38,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.475609756097561) internal successors, (242), 215 states have internal predecessors, (242), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:38,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 252 transitions. [2025-03-04 11:21:38,422 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 252 transitions. Word has length 43 [2025-03-04 11:21:38,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:38,423 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 252 transitions. [2025-03-04 11:21:38,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:38,423 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 252 transitions. [2025-03-04 11:21:38,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 11:21:38,423 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:38,423 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:38,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:21:38,423 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:38,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:38,424 INFO L85 PathProgramCache]: Analyzing trace with hash -379842763, now seen corresponding path program 1 times [2025-03-04 11:21:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006403534] [2025-03-04 11:21:38,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:38,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 11:21:38,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 11:21:38,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:38,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:38,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:38,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006403534] [2025-03-04 11:21:38,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006403534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:38,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:38,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:21:38,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56480650] [2025-03-04 11:21:38,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:38,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:21:38,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:38,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:21:38,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:38,483 INFO L87 Difference]: Start difference. First operand 222 states and 252 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:38,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:38,543 INFO L93 Difference]: Finished difference Result 223 states and 252 transitions. [2025-03-04 11:21:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:21:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2025-03-04 11:21:38,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:38,545 INFO L225 Difference]: With dead ends: 223 [2025-03-04 11:21:38,545 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 11:21:38,545 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:38,545 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 30 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:38,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 192 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:21:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 11:21:38,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2025-03-04 11:21:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 164 states have (on average 1.4695121951219512) internal successors, (241), 215 states have internal predecessors, (241), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 251 transitions. [2025-03-04 11:21:38,552 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 251 transitions. Word has length 44 [2025-03-04 11:21:38,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:38,552 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 251 transitions. [2025-03-04 11:21:38,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 251 transitions. [2025-03-04 11:21:38,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:21:38,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:38,554 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:38,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:21:38,555 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:38,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:38,555 INFO L85 PathProgramCache]: Analyzing trace with hash 43328243, now seen corresponding path program 1 times [2025-03-04 11:21:38,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:38,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735146437] [2025-03-04 11:21:38,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:38,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:38,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:21:38,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:21:38,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:38,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:38,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:38,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735146437] [2025-03-04 11:21:38,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735146437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:38,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531785371] [2025-03-04 11:21:38,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:38,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:38,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:38,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:38,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:21:38,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:21:38,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:21:38,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:38,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:38,673 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:21:38,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:38,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:38,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:21:38,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531785371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:38,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:21:38,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:21:38,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405192403] [2025-03-04 11:21:38,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:38,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:21:38,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:38,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:21:38,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:21:38,758 INFO L87 Difference]: Start difference. First operand 222 states and 251 transitions. Second operand has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:38,777 INFO L93 Difference]: Finished difference Result 222 states and 251 transitions. [2025-03-04 11:21:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:21:38,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2025-03-04 11:21:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:38,779 INFO L225 Difference]: With dead ends: 222 [2025-03-04 11:21:38,779 INFO L226 Difference]: Without dead ends: 221 [2025-03-04 11:21:38,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:21:38,780 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 88 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:38,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 239 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:21:38,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-04 11:21:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2025-03-04 11:21:38,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 164 states have (on average 1.4573170731707317) internal successors, (239), 214 states have internal predecessors, (239), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 249 transitions. [2025-03-04 11:21:38,788 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 249 transitions. Word has length 46 [2025-03-04 11:21:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:38,788 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 249 transitions. [2025-03-04 11:21:38,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.0) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 249 transitions. [2025-03-04 11:21:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-04 11:21:38,789 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:38,789 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:38,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:21:38,989 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 11:21:38,990 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:38,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:38,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1343175633, now seen corresponding path program 1 times [2025-03-04 11:21:38,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:38,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412604350] [2025-03-04 11:21:38,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:38,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:38,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:21:38,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:21:38,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:38,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:39,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412604350] [2025-03-04 11:21:39,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412604350] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:39,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413824112] [2025-03-04 11:21:39,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:39,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:39,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:39,065 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:39,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:21:39,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 11:21:39,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 11:21:39,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:39,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:39,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:21:39,098 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:39,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:39,157 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:21:39,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413824112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:39,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:21:39,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 11:21:39,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661247432] [2025-03-04 11:21:39,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:39,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:21:39,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:39,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:21:39,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:21:39,159 INFO L87 Difference]: Start difference. First operand 221 states and 249 transitions. Second operand has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:39,193 INFO L93 Difference]: Finished difference Result 304 states and 342 transitions. [2025-03-04 11:21:39,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:21:39,193 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2025-03-04 11:21:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:39,194 INFO L225 Difference]: With dead ends: 304 [2025-03-04 11:21:39,195 INFO L226 Difference]: Without dead ends: 303 [2025-03-04 11:21:39,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:21:39,195 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 85 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:39,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 564 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:21:39,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2025-03-04 11:21:39,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 238. [2025-03-04 11:21:39,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 179 states have (on average 1.458100558659218) internal successors, (261), 230 states have internal predecessors, (261), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:21:39,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 275 transitions. [2025-03-04 11:21:39,201 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 275 transitions. Word has length 47 [2025-03-04 11:21:39,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:39,202 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 275 transitions. [2025-03-04 11:21:39,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.25) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:39,202 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 275 transitions. [2025-03-04 11:21:39,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 11:21:39,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:39,202 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:39,208 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 11:21:39,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:39,403 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:39,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:39,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1993369649, now seen corresponding path program 1 times [2025-03-04 11:21:39,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:39,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677660056] [2025-03-04 11:21:39,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:39,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:39,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:21:39,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:21:39,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:39,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:39,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [656984157] [2025-03-04 11:21:39,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:39,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:39,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:39,414 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:39,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:21:39,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:21:39,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:21:39,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:39,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:39,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:21:39,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:39,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:39,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:39,724 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:39,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:39,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677660056] [2025-03-04 11:21:39,727 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:39,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656984157] [2025-03-04 11:21:39,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656984157] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:39,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:21:39,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-04 11:21:39,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134167178] [2025-03-04 11:21:39,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:39,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:21:39,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:39,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:21:39,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:21:39,728 INFO L87 Difference]: Start difference. First operand 238 states and 275 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:40,160 INFO L93 Difference]: Finished difference Result 280 states and 340 transitions. [2025-03-04 11:21:40,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:21:40,160 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2025-03-04 11:21:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:40,162 INFO L225 Difference]: With dead ends: 280 [2025-03-04 11:21:40,162 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 11:21:40,162 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:21:40,163 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 243 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:40,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 136 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:21:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 11:21:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 235. [2025-03-04 11:21:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 179 states have (on average 1.4301675977653632) internal successors, (256), 227 states have internal predecessors, (256), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:21:40,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 270 transitions. [2025-03-04 11:21:40,170 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 270 transitions. Word has length 49 [2025-03-04 11:21:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:40,170 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 270 transitions. [2025-03-04 11:21:40,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 270 transitions. [2025-03-04 11:21:40,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 11:21:40,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:40,171 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:40,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:40,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:21:40,372 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:40,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:40,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1993369685, now seen corresponding path program 1 times [2025-03-04 11:21:40,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:40,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393034142] [2025-03-04 11:21:40,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:40,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:40,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:21:40,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:21:40,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:40,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:40,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393034142] [2025-03-04 11:21:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393034142] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:40,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342913882] [2025-03-04 11:21:40,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:40,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:40,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:40,441 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:40,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:21:40,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 11:21:40,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 11:21:40,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:40,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:40,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:21:40,481 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:40,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:40,536 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:40,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:40,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342913882] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:40,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:21:40,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 13 [2025-03-04 11:21:40,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908373023] [2025-03-04 11:21:40,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:40,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 11:21:40,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:40,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 11:21:40,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:21:40,599 INFO L87 Difference]: Start difference. First operand 235 states and 270 transitions. Second operand has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:21:40,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:40,682 INFO L93 Difference]: Finished difference Result 472 states and 493 transitions. [2025-03-04 11:21:40,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:21:40,682 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 49 [2025-03-04 11:21:40,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:40,684 INFO L225 Difference]: With dead ends: 472 [2025-03-04 11:21:40,684 INFO L226 Difference]: Without dead ends: 390 [2025-03-04 11:21:40,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=228, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:21:40,685 INFO L435 NwaCegarLoop]: 157 mSDtfsCounter, 188 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:40,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 922 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:21:40,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-04 11:21:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 295. [2025-03-04 11:21:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 235 states have (on average 1.4553191489361703) internal successors, (342), 283 states have internal predecessors, (342), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:21:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 358 transitions. [2025-03-04 11:21:40,694 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 358 transitions. Word has length 49 [2025-03-04 11:21:40,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:40,694 INFO L471 AbstractCegarLoop]: Abstraction has 295 states and 358 transitions. [2025-03-04 11:21:40,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.615384615384615) internal successors, (99), 13 states have internal predecessors, (99), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 11:21:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 358 transitions. [2025-03-04 11:21:40,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 11:21:40,694 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:40,694 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:40,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:40,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:40,895 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:40,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1664916881, now seen corresponding path program 1 times [2025-03-04 11:21:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:40,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335706515] [2025-03-04 11:21:40,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:40,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:21:40,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:21:40,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:40,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:40,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624857720] [2025-03-04 11:21:40,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:40,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:40,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:40,906 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:40,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:21:40,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 11:21:40,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 11:21:40,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:40,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:40,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:21:40,935 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:41,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:41,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:41,131 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:41,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335706515] [2025-03-04 11:21:41,131 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:41,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624857720] [2025-03-04 11:21:41,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624857720] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:41,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:21:41,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:21:41,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863412068] [2025-03-04 11:21:41,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:41,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:21:41,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:41,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:21:41,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:21:41,132 INFO L87 Difference]: Start difference. First operand 295 states and 358 transitions. Second operand has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:41,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:41,581 INFO L93 Difference]: Finished difference Result 316 states and 364 transitions. [2025-03-04 11:21:41,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:21:41,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-03-04 11:21:41,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:41,583 INFO L225 Difference]: With dead ends: 316 [2025-03-04 11:21:41,583 INFO L226 Difference]: Without dead ends: 304 [2025-03-04 11:21:41,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:21:41,584 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 234 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:41,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 239 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:21:41,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-04 11:21:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 290. [2025-03-04 11:21:41,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 236 states have (on average 1.3728813559322033) internal successors, (324), 277 states have internal predecessors, (324), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-04 11:21:41,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 340 transitions. [2025-03-04 11:21:41,593 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 340 transitions. Word has length 50 [2025-03-04 11:21:41,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:41,593 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 340 transitions. [2025-03-04 11:21:41,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 340 transitions. [2025-03-04 11:21:41,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 11:21:41,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:41,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:41,599 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 11:21:41,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:41,795 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:41,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:41,795 INFO L85 PathProgramCache]: Analyzing trace with hash -251742265, now seen corresponding path program 1 times [2025-03-04 11:21:41,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:41,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206566845] [2025-03-04 11:21:41,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:41,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:41,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:21:41,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:21:41,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:41,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:41,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931316407] [2025-03-04 11:21:41,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:41,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:41,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:41,809 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:41,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:21:41,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 11:21:41,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 11:21:41,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:41,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:41,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:21:41,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:41,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:21:41,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:41,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206566845] [2025-03-04 11:21:41,966 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:41,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931316407] [2025-03-04 11:21:41,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931316407] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:41,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:41,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:21:41,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812088487] [2025-03-04 11:21:41,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:41,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:21:41,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:41,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:21:41,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:21:41,967 INFO L87 Difference]: Start difference. First operand 290 states and 340 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:42,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:42,131 INFO L93 Difference]: Finished difference Result 300 states and 350 transitions. [2025-03-04 11:21:42,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:21:42,131 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2025-03-04 11:21:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:42,132 INFO L225 Difference]: With dead ends: 300 [2025-03-04 11:21:42,133 INFO L226 Difference]: Without dead ends: 229 [2025-03-04 11:21:42,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 11:21:42,134 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 150 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:42,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 49 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:21:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2025-03-04 11:21:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 217. [2025-03-04 11:21:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 189 states have (on average 1.1851851851851851) internal successors, (224), 206 states have internal predecessors, (224), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:42,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 234 transitions. [2025-03-04 11:21:42,142 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 234 transitions. Word has length 57 [2025-03-04 11:21:42,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:42,142 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 234 transitions. [2025-03-04 11:21:42,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 11:21:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 234 transitions. [2025-03-04 11:21:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-04 11:21:42,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:42,143 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:42,149 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:42,343 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 11:21:42,344 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:42,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 105451691, now seen corresponding path program 1 times [2025-03-04 11:21:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:42,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139673234] [2025-03-04 11:21:42,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:42,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:42,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:21:42,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:21:42,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:42,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:42,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1603906873] [2025-03-04 11:21:42,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:42,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:42,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:42,358 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:42,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:21:42,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-04 11:21:42,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-04 11:21:42,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:42,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:42,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:21:42,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:42,538 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:21:42,539 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:42,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:42,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139673234] [2025-03-04 11:21:42,669 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:42,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603906873] [2025-03-04 11:21:42,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603906873] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:42,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:21:42,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 11:21:42,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701305635] [2025-03-04 11:21:42,669 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:42,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:21:42,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:42,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:21:42,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:21:42,670 INFO L87 Difference]: Start difference. First operand 217 states and 234 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:42,800 INFO L93 Difference]: Finished difference Result 217 states and 234 transitions. [2025-03-04 11:21:42,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:21:42,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 77 [2025-03-04 11:21:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:42,802 INFO L225 Difference]: With dead ends: 217 [2025-03-04 11:21:42,802 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 11:21:42,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:21:42,803 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:42,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 48 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:21:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 11:21:42,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-04 11:21:42,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 189 states have (on average 1.1587301587301588) internal successors, (219), 204 states have internal predecessors, (219), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 229 transitions. [2025-03-04 11:21:42,810 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 229 transitions. Word has length 77 [2025-03-04 11:21:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:42,810 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 229 transitions. [2025-03-04 11:21:42,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 229 transitions. [2025-03-04 11:21:42,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 11:21:42,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:42,810 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:42,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:43,015 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 11:21:43,015 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:43,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:43,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1025964848, now seen corresponding path program 1 times [2025-03-04 11:21:43,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:43,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950760687] [2025-03-04 11:21:43,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:43,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:43,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 11:21:43,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:21:43,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:43,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:43,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158150607] [2025-03-04 11:21:43,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:43,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:43,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:43,031 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:43,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:21:43,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 11:21:43,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:21:43,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:43,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:43,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:21:43,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:21:43,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:43,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:43,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950760687] [2025-03-04 11:21:43,287 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:43,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158150607] [2025-03-04 11:21:43,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158150607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:43,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:21:43,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:21:43,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808199765] [2025-03-04 11:21:43,288 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:43,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:21:43,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:43,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:21:43,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:21:43,290 INFO L87 Difference]: Start difference. First operand 215 states and 229 transitions. Second operand has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:43,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:43,453 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2025-03-04 11:21:43,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:21:43,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 78 [2025-03-04 11:21:43,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:43,454 INFO L225 Difference]: With dead ends: 224 [2025-03-04 11:21:43,454 INFO L226 Difference]: Without dead ends: 220 [2025-03-04 11:21:43,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:21:43,455 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:43,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 130 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:21:43,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-03-04 11:21:43,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-03-04 11:21:43,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 194 states have (on average 1.1494845360824741) internal successors, (223), 209 states have internal predecessors, (223), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:43,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 233 transitions. [2025-03-04 11:21:43,476 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 233 transitions. Word has length 78 [2025-03-04 11:21:43,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:43,476 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 233 transitions. [2025-03-04 11:21:43,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.2) internal successors, (71), 6 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:43,477 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 233 transitions. [2025-03-04 11:21:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 11:21:43,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:43,477 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:43,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:43,682 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 11:21:43,682 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:43,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:43,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1531483673, now seen corresponding path program 1 times [2025-03-04 11:21:43,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:43,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686879163] [2025-03-04 11:21:43,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:43,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:43,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:21:43,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:21:43,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:43,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:43,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [723398295] [2025-03-04 11:21:43,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:43,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:43,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:43,697 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:43,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:21:43,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:21:43,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:21:43,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:43,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:43,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:21:43,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:43,881 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:21:43,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:44,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:44,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686879163] [2025-03-04 11:21:44,003 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:44,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723398295] [2025-03-04 11:21:44,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723398295] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:44,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:21:44,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 11:21:44,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252700144] [2025-03-04 11:21:44,003 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:44,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:21:44,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:44,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:21:44,005 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:21:44,005 INFO L87 Difference]: Start difference. First operand 220 states and 233 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:44,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:44,175 INFO L93 Difference]: Finished difference Result 221 states and 233 transitions. [2025-03-04 11:21:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:21:44,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 81 [2025-03-04 11:21:44,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:44,178 INFO L225 Difference]: With dead ends: 221 [2025-03-04 11:21:44,178 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 11:21:44,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:21:44,178 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 6 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:44,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 118 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:21:44,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 11:21:44,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-04 11:21:44,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 189 states have (on average 1.1481481481481481) internal successors, (217), 204 states have internal predecessors, (217), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:44,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 227 transitions. [2025-03-04 11:21:44,184 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 227 transitions. Word has length 81 [2025-03-04 11:21:44,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:44,184 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 227 transitions. [2025-03-04 11:21:44,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:44,185 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 227 transitions. [2025-03-04 11:21:44,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-04 11:21:44,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:44,185 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:44,191 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 11:21:44,385 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 11:21:44,386 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:44,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:44,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1247819213, now seen corresponding path program 1 times [2025-03-04 11:21:44,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:44,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715033384] [2025-03-04 11:21:44,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:44,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:44,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 11:21:44,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 11:21:44,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:44,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:44,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287741560] [2025-03-04 11:21:44,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:44,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:44,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:44,398 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 11:21:44,399 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 11:21:44,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 11:21:44,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 11:21:44,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:44,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:44,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 11:21:44,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:44,493 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:21:44,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 11:21:44,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:44,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715033384] [2025-03-04 11:21:44,609 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:44,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287741560] [2025-03-04 11:21:44,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287741560] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:44,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:21:44,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2025-03-04 11:21:44,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773728152] [2025-03-04 11:21:44,610 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:44,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:21:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:44,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:21:44,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:21:44,610 INFO L87 Difference]: Start difference. First operand 215 states and 227 transitions. Second operand has 8 states, 7 states have (on average 20.857142857142858) internal successors, (146), 8 states have internal predecessors, (146), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:21:44,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:44,801 INFO L93 Difference]: Finished difference Result 224 states and 235 transitions. [2025-03-04 11:21:44,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:21:44,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 20.857142857142858) internal successors, (146), 8 states have internal predecessors, (146), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 82 [2025-03-04 11:21:44,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:44,802 INFO L225 Difference]: With dead ends: 224 [2025-03-04 11:21:44,802 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 11:21:44,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:21:44,802 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 140 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:44,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 154 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:21:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 11:21:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 211. [2025-03-04 11:21:44,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 189 states have (on average 1.1005291005291005) internal successors, (208), 200 states have internal predecessors, (208), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:44,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 218 transitions. [2025-03-04 11:21:44,808 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 218 transitions. Word has length 82 [2025-03-04 11:21:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:44,808 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 218 transitions. [2025-03-04 11:21:44,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 20.857142857142858) internal successors, (146), 8 states have internal predecessors, (146), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-04 11:21:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 218 transitions. [2025-03-04 11:21:44,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 11:21:44,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:44,809 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:21:44,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:45,010 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 11:21:45,010 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:45,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:45,010 INFO L85 PathProgramCache]: Analyzing trace with hash 251625764, now seen corresponding path program 2 times [2025-03-04 11:21:45,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:45,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480864423] [2025-03-04 11:21:45,011 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:21:45,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:45,016 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-03-04 11:21:45,027 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 11:21:45,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:21:45,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:45,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [529911108] [2025-03-04 11:21:45,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:21:45,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:45,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:45,031 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 11:21:45,032 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 11:21:45,060 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-03-04 11:21:45,068 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 120 statements. [2025-03-04 11:21:45,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:21:45,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:45,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:21:45,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:45,324 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-03-04 11:21:45,324 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:21:45,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:45,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480864423] [2025-03-04 11:21:45,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:45,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529911108] [2025-03-04 11:21:45,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529911108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:21:45,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:21:45,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:21:45,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288820090] [2025-03-04 11:21:45,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:21:45,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:21:45,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:45,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:21:45,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:45,325 INFO L87 Difference]: Start difference. First operand 211 states and 218 transitions. Second operand has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:45,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:45,388 INFO L93 Difference]: Finished difference Result 213 states and 218 transitions. [2025-03-04 11:21:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:21:45,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 120 [2025-03-04 11:21:45,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:45,389 INFO L225 Difference]: With dead ends: 213 [2025-03-04 11:21:45,389 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 11:21:45,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:21:45,390 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 47 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:45,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 57 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:21:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 11:21:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-04 11:21:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 183 states have (on average 1.0765027322404372) internal successors, (197), 193 states have internal predecessors, (197), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 207 transitions. [2025-03-04 11:21:45,395 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 207 transitions. Word has length 120 [2025-03-04 11:21:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:45,396 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 207 transitions. [2025-03-04 11:21:45,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 11:21:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 207 transitions. [2025-03-04 11:21:45,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 11:21:45,396 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:45,396 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 11:21:45,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:45,597 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 11:21:45,597 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:45,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash 251627365, now seen corresponding path program 1 times [2025-03-04 11:21:45,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:45,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164237560] [2025-03-04 11:21:45,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:45,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:45,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 11:21:45,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 11:21:45,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:45,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-03-04 11:21:45,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:45,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164237560] [2025-03-04 11:21:45,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164237560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:45,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619949492] [2025-03-04 11:21:45,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:45,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:45,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:45,677 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 11:21:45,679 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 11:21:45,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 11:21:45,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 11:21:45,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:45,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:45,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 11:21:45,717 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:45,801 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:21:45,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:45,900 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:21:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619949492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:45,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:21:45,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4, 4] total 9 [2025-03-04 11:21:45,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845634336] [2025-03-04 11:21:45,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:45,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:21:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:45,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:21:45,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:21:45,902 INFO L87 Difference]: Start difference. First operand 204 states and 207 transitions. Second operand has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 10 states have internal predecessors, (253), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:21:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:45,956 INFO L93 Difference]: Finished difference Result 233 states and 235 transitions. [2025-03-04 11:21:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:21:45,956 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 10 states have internal predecessors, (253), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 120 [2025-03-04 11:21:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:45,957 INFO L225 Difference]: With dead ends: 233 [2025-03-04 11:21:45,957 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 11:21:45,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=88, Invalid=122, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:21:45,960 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 98 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:45,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 269 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:21:45,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 11:21:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 203. [2025-03-04 11:21:45,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 183 states have (on average 1.0655737704918034) internal successors, (195), 192 states have internal predecessors, (195), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 205 transitions. [2025-03-04 11:21:45,966 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 205 transitions. Word has length 120 [2025-03-04 11:21:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:45,966 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 205 transitions. [2025-03-04 11:21:45,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 28.11111111111111) internal successors, (253), 10 states have internal predecessors, (253), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-04 11:21:45,966 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 205 transitions. [2025-03-04 11:21:45,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 11:21:45,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:45,966 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1] [2025-03-04 11:21:45,973 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:21:46,167 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 11:21:46,167 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:46,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:46,167 INFO L85 PathProgramCache]: Analyzing trace with hash 722397311, now seen corresponding path program 1 times [2025-03-04 11:21:46,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:46,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368078499] [2025-03-04 11:21:46,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:46,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:46,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 11:21:46,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 11:21:46,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:46,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [886605928] [2025-03-04 11:21:46,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:46,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:46,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:46,196 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 11:21:46,197 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 11:21:46,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 11:21:46,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 11:21:46,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:46,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:46,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 11:21:46,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:46,339 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:21:46,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:46,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:46,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368078499] [2025-03-04 11:21:46,385 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:46,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [886605928] [2025-03-04 11:21:46,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [886605928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:46,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:21:46,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 11:21:46,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816549770] [2025-03-04 11:21:46,385 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:46,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 11:21:46,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:46,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 11:21:46,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:21:46,386 INFO L87 Difference]: Start difference. First operand 203 states and 205 transitions. Second operand has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:21:46,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:46,521 INFO L93 Difference]: Finished difference Result 234 states and 237 transitions. [2025-03-04 11:21:46,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:21:46,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 126 [2025-03-04 11:21:46,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:46,523 INFO L225 Difference]: With dead ends: 234 [2025-03-04 11:21:46,523 INFO L226 Difference]: Without dead ends: 232 [2025-03-04 11:21:46,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:21:46,523 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 34 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:46,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 114 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:21:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-04 11:21:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 209. [2025-03-04 11:21:46,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 189 states have (on average 1.0634920634920635) internal successors, (201), 198 states have internal predecessors, (201), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:46,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 211 transitions. [2025-03-04 11:21:46,529 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 211 transitions. Word has length 126 [2025-03-04 11:21:46,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:46,529 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 211 transitions. [2025-03-04 11:21:46,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 22.8) internal successors, (114), 6 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 11:21:46,530 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 211 transitions. [2025-03-04 11:21:46,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 11:21:46,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:46,530 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1] [2025-03-04 11:21:46,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:21:46,734 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 11:21:46,735 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:46,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:46,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1560885027, now seen corresponding path program 1 times [2025-03-04 11:21:46,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:46,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885794549] [2025-03-04 11:21:46,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:46,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:46,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 11:21:46,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 11:21:46,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:46,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:46,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [324079838] [2025-03-04 11:21:46,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:46,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:46,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:46,750 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:46,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:21:46,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 11:21:46,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 11:21:46,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:46,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:46,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 11:21:46,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 3 proven. 117 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:21:47,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 3 proven. 117 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 11:21:47,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:47,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885794549] [2025-03-04 11:21:47,889 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:47,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324079838] [2025-03-04 11:21:47,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324079838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:47,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:21:47,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2025-03-04 11:21:47,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931195344] [2025-03-04 11:21:47,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:47,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:21:47,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:47,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:21:47,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:21:47,890 INFO L87 Difference]: Start difference. First operand 209 states and 211 transitions. Second operand has 19 states, 18 states have (on average 12.944444444444445) internal successors, (233), 19 states have internal predecessors, (233), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:21:49,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:49,589 INFO L93 Difference]: Finished difference Result 226 states and 230 transitions. [2025-03-04 11:21:49,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:21:49,592 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 12.944444444444445) internal successors, (233), 19 states have internal predecessors, (233), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 128 [2025-03-04 11:21:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:49,593 INFO L225 Difference]: With dead ends: 226 [2025-03-04 11:21:49,593 INFO L226 Difference]: Without dead ends: 225 [2025-03-04 11:21:49,593 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=170, Invalid=430, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:21:49,594 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 168 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:49,594 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 248 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 11:21:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-04 11:21:49,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 208. [2025-03-04 11:21:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 189 states have (on average 1.052910052910053) internal successors, (199), 197 states have internal predecessors, (199), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 209 transitions. [2025-03-04 11:21:49,601 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 209 transitions. Word has length 128 [2025-03-04 11:21:49,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:49,601 INFO L471 AbstractCegarLoop]: Abstraction has 208 states and 209 transitions. [2025-03-04 11:21:49,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 12.944444444444445) internal successors, (233), 19 states have internal predecessors, (233), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 11:21:49,601 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 209 transitions. [2025-03-04 11:21:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 11:21:49,602 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:49,602 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 3, 3, 3, 1, 1, 1] [2025-03-04 11:21:49,608 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:49,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 11:21:49,803 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:49,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:49,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1388723735, now seen corresponding path program 2 times [2025-03-04 11:21:49,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:49,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740139891] [2025-03-04 11:21:49,803 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:21:49,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:49,809 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-04 11:21:49,820 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 11:21:49,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:21:49,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:49,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543078791] [2025-03-04 11:21:49,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:21:49,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:49,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:49,825 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:49,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:21:49,846 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 134 statements into 2 equivalence classes. [2025-03-04 11:21:49,862 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 11:21:49,862 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:21:49,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:49,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:21:49,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:21:50,077 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:50,282 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:21:50,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740139891] [2025-03-04 11:21:50,283 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:50,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543078791] [2025-03-04 11:21:50,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543078791] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:50,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:21:50,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 11:21:50,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308222059] [2025-03-04 11:21:50,283 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:50,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 11:21:50,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:50,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 11:21:50,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:21:50,284 INFO L87 Difference]: Start difference. First operand 208 states and 209 transitions. Second operand has 16 states, 15 states have (on average 16.0) internal successors, (240), 16 states have internal predecessors, (240), 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 11:21:50,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:50,895 INFO L93 Difference]: Finished difference Result 363 states and 389 transitions. [2025-03-04 11:21:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:21:50,896 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 16.0) internal successors, (240), 16 states have internal predecessors, (240), 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) Word has length 134 [2025-03-04 11:21:50,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:50,897 INFO L225 Difference]: With dead ends: 363 [2025-03-04 11:21:50,897 INFO L226 Difference]: Without dead ends: 360 [2025-03-04 11:21:50,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 252 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=307, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:21:50,898 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 319 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 1091 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1091 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:50,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 289 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1091 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 11:21:50,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-03-04 11:21:50,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 327. [2025-03-04 11:21:50,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 304 states have (on average 1.069078947368421) internal successors, (325), 312 states have internal predecessors, (325), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 11:21:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 343 transitions. [2025-03-04 11:21:50,909 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 343 transitions. Word has length 134 [2025-03-04 11:21:50,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:50,909 INFO L471 AbstractCegarLoop]: Abstraction has 327 states and 343 transitions. [2025-03-04 11:21:50,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 16.0) internal successors, (240), 16 states have internal predecessors, (240), 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 11:21:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 343 transitions. [2025-03-04 11:21:50,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-04 11:21:50,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:50,910 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1] [2025-03-04 11:21:50,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 11:21:51,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:51,110 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:51,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash -882214063, now seen corresponding path program 1 times [2025-03-04 11:21:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:51,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259373180] [2025-03-04 11:21:51,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:51,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:51,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 11:21:51,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 11:21:51,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:51,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:51,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1617301224] [2025-03-04 11:21:51,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:51,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:51,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:51,124 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:51,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:21:51,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 11:21:51,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 11:21:51,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:51,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:51,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:21:51,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:51,269 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:21:51,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 11:21:51,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259373180] [2025-03-04 11:21:51,496 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:51,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617301224] [2025-03-04 11:21:51,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617301224] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:51,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:21:51,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 11:21:51,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428838429] [2025-03-04 11:21:51,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:51,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 11:21:51,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:51,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 11:21:51,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 11:21:51,497 INFO L87 Difference]: Start difference. First operand 327 states and 343 transitions. Second operand has 10 states, 9 states have (on average 28.0) internal successors, (252), 10 states have internal predecessors, (252), 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 11:21:51,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:51,952 INFO L93 Difference]: Finished difference Result 429 states and 460 transitions. [2025-03-04 11:21:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:21:51,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 28.0) internal successors, (252), 10 states have internal predecessors, (252), 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) Word has length 140 [2025-03-04 11:21:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:51,954 INFO L225 Difference]: With dead ends: 429 [2025-03-04 11:21:51,954 INFO L226 Difference]: Without dead ends: 388 [2025-03-04 11:21:51,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:21:51,954 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 243 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:51,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 271 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:21:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-04 11:21:51,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 376. [2025-03-04 11:21:51,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 352 states have (on average 1.0482954545454546) internal successors, (369), 360 states have internal predecessors, (369), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:21:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 389 transitions. [2025-03-04 11:21:51,967 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 389 transitions. Word has length 140 [2025-03-04 11:21:51,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:51,967 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 389 transitions. [2025-03-04 11:21:51,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 28.0) internal successors, (252), 10 states have internal predecessors, (252), 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 11:21:51,968 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 389 transitions. [2025-03-04 11:21:51,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-04 11:21:51,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:51,968 INFO L218 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2025-03-04 11:21:51,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:52,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:52,169 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:52,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:52,170 INFO L85 PathProgramCache]: Analyzing trace with hash -35935796, now seen corresponding path program 1 times [2025-03-04 11:21:52,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:52,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526079533] [2025-03-04 11:21:52,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:52,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:52,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 11:21:52,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 11:21:52,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:52,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:52,377 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:21:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:52,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526079533] [2025-03-04 11:21:52,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526079533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:52,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122961497] [2025-03-04 11:21:52,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:52,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:52,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:52,380 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:52,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:21:52,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-04 11:21:52,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-04 11:21:52,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:52,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:52,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 11:21:52,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:52,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:52,763 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 11:21:52,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122961497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:52,764 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:21:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 12] total 15 [2025-03-04 11:21:52,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383567229] [2025-03-04 11:21:52,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:52,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 11:21:52,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:52,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 11:21:52,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:21:52,765 INFO L87 Difference]: Start difference. First operand 376 states and 389 transitions. Second operand has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 4 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:21:52,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:52,851 INFO L93 Difference]: Finished difference Result 387 states and 398 transitions. [2025-03-04 11:21:52,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 11:21:52,852 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 4 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 176 [2025-03-04 11:21:52,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:52,853 INFO L225 Difference]: With dead ends: 387 [2025-03-04 11:21:52,853 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 11:21:52,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 340 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2025-03-04 11:21:52,854 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 19 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:52,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 635 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:21:52,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 11:21:52,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2025-03-04 11:21:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 355 states have (on average 1.0450704225352112) internal successors, (371), 363 states have internal predecessors, (371), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:21:52,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 391 transitions. [2025-03-04 11:21:52,873 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 391 transitions. Word has length 176 [2025-03-04 11:21:52,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:52,873 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 391 transitions. [2025-03-04 11:21:52,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 11.8) internal successors, (177), 15 states have internal predecessors, (177), 4 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:21:52,873 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 391 transitions. [2025-03-04 11:21:52,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-04 11:21:52,875 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:52,875 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-04 11:21:52,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:53,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:53,076 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:53,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:53,076 INFO L85 PathProgramCache]: Analyzing trace with hash -660770528, now seen corresponding path program 2 times [2025-03-04 11:21:53,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:53,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733949373] [2025-03-04 11:21:53,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:21:53,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:53,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-03-04 11:21:53,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 11:21:53,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:21:53,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:53,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [650682525] [2025-03-04 11:21:53,096 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:21:53,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:53,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:53,098 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:53,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 11:21:53,121 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 218 statements into 2 equivalence classes. [2025-03-04 11:21:53,160 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 218 of 218 statements. [2025-03-04 11:21:53,160 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:21:53,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:53,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:21:53,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:53,538 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:21:53,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:21:54,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733949373] [2025-03-04 11:21:54,163 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:54,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650682525] [2025-03-04 11:21:54,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650682525] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:54,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:21:54,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2025-03-04 11:21:54,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074416182] [2025-03-04 11:21:54,163 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:54,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 11:21:54,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:54,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 11:21:54,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2025-03-04 11:21:54,164 INFO L87 Difference]: Start difference. First operand 380 states and 391 transitions. Second operand has 14 states, 13 states have (on average 29.846153846153847) internal successors, (388), 14 states have internal predecessors, (388), 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 11:21:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:55,214 INFO L93 Difference]: Finished difference Result 614 states and 657 transitions. [2025-03-04 11:21:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 11:21:55,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 29.846153846153847) internal successors, (388), 14 states have internal predecessors, (388), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 218 [2025-03-04 11:21:55,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:55,216 INFO L225 Difference]: With dead ends: 614 [2025-03-04 11:21:55,216 INFO L226 Difference]: Without dead ends: 613 [2025-03-04 11:21:55,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:21:55,217 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 429 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:55,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 484 Invalid, 1419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 11:21:55,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2025-03-04 11:21:55,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 526. [2025-03-04 11:21:55,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 497 states have (on average 1.062374245472837) internal successors, (528), 505 states have internal predecessors, (528), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 11:21:55,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 556 transitions. [2025-03-04 11:21:55,235 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 556 transitions. Word has length 218 [2025-03-04 11:21:55,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:55,235 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 556 transitions. [2025-03-04 11:21:55,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 29.846153846153847) internal successors, (388), 14 states have internal predecessors, (388), 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 11:21:55,236 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 556 transitions. [2025-03-04 11:21:55,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2025-03-04 11:21:55,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:55,239 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:55,245 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:55,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-04 11:21:55,443 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:55,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:55,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1179657321, now seen corresponding path program 1 times [2025-03-04 11:21:55,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:55,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198415638] [2025-03-04 11:21:55,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:55,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:55,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 11:21:55,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 11:21:55,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:55,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 11:21:55,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [281514819] [2025-03-04 11:21:55,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:21:55,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:55,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:55,463 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:55,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 11:21:55,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-03-04 11:21:55,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-03-04 11:21:55,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:21:55,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:55,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 11:21:55,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 11:21:55,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:56,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:56,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198415638] [2025-03-04 11:21:56,261 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 11:21:56,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281514819] [2025-03-04 11:21:56,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281514819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:56,262 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:21:56,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 11:21:56,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456818062] [2025-03-04 11:21:56,262 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:56,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:21:56,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:56,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:21:56,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2025-03-04 11:21:56,263 INFO L87 Difference]: Start difference. First operand 526 states and 556 transitions. Second operand has 9 states, 8 states have (on average 24.875) internal successors, (199), 9 states have internal predecessors, (199), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:56,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:56,622 INFO L93 Difference]: Finished difference Result 532 states and 561 transitions. [2025-03-04 11:21:56,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:21:56,623 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 24.875) internal successors, (199), 9 states have internal predecessors, (199), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 221 [2025-03-04 11:21:56,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:56,624 INFO L225 Difference]: With dead ends: 532 [2025-03-04 11:21:56,624 INFO L226 Difference]: Without dead ends: 526 [2025-03-04 11:21:56,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 395 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:21:56,625 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 29 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 1371 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:56,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 469 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:21:56,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-04 11:21:56,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-04 11:21:56,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 497 states have (on average 1.0603621730382293) internal successors, (527), 505 states have internal predecessors, (527), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 11:21:56,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 555 transitions. [2025-03-04 11:21:56,642 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 555 transitions. Word has length 221 [2025-03-04 11:21:56,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:56,642 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 555 transitions. [2025-03-04 11:21:56,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 24.875) internal successors, (199), 9 states have internal predecessors, (199), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 11:21:56,642 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 555 transitions. [2025-03-04 11:21:56,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-03-04 11:21:56,644 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:21:56,644 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:56,650 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:56,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 11:21:56,848 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 59 more)] === [2025-03-04 11:21:56,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:21:56,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1361056573, now seen corresponding path program 2 times [2025-03-04 11:21:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:21:56,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974369199] [2025-03-04 11:21:56,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:21:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:21:56,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 263 statements into 2 equivalence classes. [2025-03-04 11:21:56,864 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 11:21:56,864 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:21:56,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 570 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:21:57,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:21:57,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974369199] [2025-03-04 11:21:57,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974369199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:21:57,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534195742] [2025-03-04 11:21:57,121 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:21:57,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:21:57,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:21:57,123 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:21:57,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 11:21:57,149 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 263 statements into 2 equivalence classes. [2025-03-04 11:21:57,182 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 263 of 263 statements. [2025-03-04 11:21:57,182 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:21:57,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:21:57,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:21:57,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:21:57,371 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 649 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:21:57,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:21:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 654 backedges. 589 proven. 5 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 11:21:57,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534195742] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:21:57,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:21:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 17 [2025-03-04 11:21:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425186777] [2025-03-04 11:21:57,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:21:57,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 11:21:57,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:21:57,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 11:21:57,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-03-04 11:21:57,599 INFO L87 Difference]: Start difference. First operand 526 states and 555 transitions. Second operand has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 17 states have internal predecessors, (260), 6 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 11:21:57,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:21:57,740 INFO L93 Difference]: Finished difference Result 530 states and 558 transitions. [2025-03-04 11:21:57,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 11:21:57,742 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 17 states have internal predecessors, (260), 6 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) Word has length 263 [2025-03-04 11:21:57,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:21:57,742 INFO L225 Difference]: With dead ends: 530 [2025-03-04 11:21:57,742 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:21:57,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 513 SyntacticMatches, 11 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=199, Invalid=503, Unknown=0, NotChecked=0, Total=702 [2025-03-04 11:21:57,744 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 20 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:21:57,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1354 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:21:57,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:21:57,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:21:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:21:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:21:57,745 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 263 [2025-03-04 11:21:57,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:21:57,746 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:21:57,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 15.294117647058824) internal successors, (260), 17 states have internal predecessors, (260), 6 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (12), 6 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-04 11:21:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:21:57,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:21:57,748 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 62 remaining) [2025-03-04 11:21:57,749 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 62 remaining) [2025-03-04 11:21:57,750 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 62 remaining) [2025-03-04 11:21:57,751 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 62 remaining) [2025-03-04 11:21:57,752 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 62 remaining) [2025-03-04 11:21:57,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 11:21:57,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-04 11:21:57,956 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:21:57,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:21:58,293 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:21:58,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:21:58 BoogieIcfgContainer [2025-03-04 11:21:58,308 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:21:58,308 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:21:58,308 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:21:58,308 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:21:58,309 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:21:36" (3/4) ... [2025-03-04 11:21:58,310 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:21:58,315 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 11:21:58,320 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 11:21:58,321 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 11:21:58,321 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 11:21:58,321 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:21:58,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:21:58,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:21:58,385 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:21:58,385 INFO L158 Benchmark]: Toolchain (without parser) took 22747.08ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 110.3MB in the beginning and 132.5MB in the end (delta: -22.2MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2025-03-04 11:21:58,385 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:21:58,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.38ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 99.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:21:58,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.79ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 98.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:21:58,386 INFO L158 Benchmark]: Boogie Preprocessor took 20.07ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:21:58,386 INFO L158 Benchmark]: IcfgBuilder took 435.64ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 74.0MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 11:21:58,386 INFO L158 Benchmark]: TraceAbstraction took 22034.87ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 74.0MB in the beginning and 138.8MB in the end (delta: -64.8MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2025-03-04 11:21:58,386 INFO L158 Benchmark]: Witness Printer took 76.49ms. Allocated memory is still 176.2MB. Free memory was 138.8MB in the beginning and 132.5MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:21:58,387 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 127.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 152.38ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 99.2MB in the end (delta: 11.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.79ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 98.0MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.07ms. Allocated memory is still 142.6MB. Free memory was 98.0MB in the beginning and 96.6MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 435.64ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 74.0MB in the end (delta: 22.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22034.87ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 74.0MB in the beginning and 138.8MB in the end (delta: -64.8MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. * Witness Printer took 76.49ms. Allocated memory is still 176.2MB. Free memory was 138.8MB in the beginning and 132.5MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 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: 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: 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: 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: 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: 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: 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: 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: 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: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 27]: 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, 142 locations, 62 error locations. Started 1 CEGAR loops. OverallTime: 21.6s, OverallIterations: 28, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3035 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3007 mSDsluCounter, 8402 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6176 mSDsCounter, 276 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9456 IncrementalHoareTripleChecker+Invalid, 9732 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 276 mSolverCounterUnsat, 2226 mSDtfsCounter, 9456 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4116 GetRequests, 3840 SyntacticMatches, 21 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 713 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=526occurred in iteration=26, InterpolantAutomatonStates: 218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 28 MinimizatonAttempts, 501 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 4772 NumberOfCodeBlocks, 4688 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 4525 ConstructedInterpolants, 0 QuantifiedInterpolants, 26860 SizeOfPredicates, 32 NumberOfNonLiveVariables, 3526 ConjunctsInSsa, 191 ConjunctsInUnsatCore, 45 InterpolantComputations, 13 PerfectInterpolantSequences, 2453/5737 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 62 specifications checked. All of them hold - InvariantResult [Line: 27]: Location Invariant Derived location invariant: (((((((((((((5 == y) && (k <= 32767)) && (counter == 5)) && (c <= 9223372036854775804)) && (125 <= x)) && (0 <= c)) && (x <= 2305843009213693735)) && (1 <= k)) || ((((((((k <= 32767) && (y == 4)) && (counter == 4)) && (c <= 9223372036854775804)) && (64 <= x)) && (0 <= c)) && (x <= 2305843009213693610)) && (1 <= k))) || (((((((counter == 3) && (x == 36)) && (k <= 32767)) && (3 == y)) && (0 <= c)) && (c <= 32766)) && (1 <= k))) || ((((((c == 0) && (k <= 32767)) && (y == 0)) && (counter == 0)) && (0 <= (k + 32768))) && (x == 0))) || (((((((k <= 32767) && (9 == x)) && (2 == y)) && (0 <= c)) && (c <= 2)) && (1 <= k)) && (counter == 2))) || (((((((k <= 32767) && (c <= 1)) && (x == 1)) && (0 <= c)) && (y == 1)) && (1 <= k)) && (counter == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:21:58,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE