./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 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/hard2_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ab6b58208d0c243ef581620bcab9aae54e201e00d3505f3320b182de5e7ff75 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:27:56,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:27:56,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:27:56,120 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:27:56,122 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:27:56,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:27:56,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:27:56,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:27:56,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:27:56,143 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:27:56,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:27:56,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:27:56,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:27:56,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:27:56,143 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:27:56,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:27:56,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:27:56,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:27:56,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:27:56,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:27:56,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:27:56,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:27:56,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:27:56,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:27:56,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:27:56,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:27:56,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:27:56,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:27:56,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:27:56,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:27:56,147 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 -> 1ab6b58208d0c243ef581620bcab9aae54e201e00d3505f3320b182de5e7ff75 [2025-03-17 15:27:56,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:27:56,364 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:27:56,366 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:27:56,367 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:27:56,367 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:27:56,368 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound2.c [2025-03-17 15:27:57,549 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0480946/86bf5ab538034ea1ac54764381d9271e/FLAG11d53541e [2025-03-17 15:27:57,787 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:27:57,791 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/hard2_unwindbound2.c [2025-03-17 15:27:57,799 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0480946/86bf5ab538034ea1ac54764381d9271e/FLAG11d53541e [2025-03-17 15:27:57,835 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b0480946/86bf5ab538034ea1ac54764381d9271e [2025-03-17 15:27:57,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:27:57,837 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:27:57,839 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:27:57,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:27:57,844 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:27:57,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:57" (1/1) ... [2025-03-17 15:27:57,845 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64e83f00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:57, skipping insertion in model container [2025-03-17 15:27:57,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:27:57" (1/1) ... [2025-03-17 15:27:57,859 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:27:57,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:27:57,998 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:27:58,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:27:58,022 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:27:58,023 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58 WrapperNode [2025-03-17 15:27:58,023 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:27:58,024 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:27:58,024 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:27:58,024 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:27:58,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,048 INFO L138 Inliner]: procedures = 14, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 101 [2025-03-17 15:27:58,048 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:27:58,049 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:27:58,049 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:27:58,049 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:27:58,054 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,055 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,056 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,063 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2025-03-17 15:27:58,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,064 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,066 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,068 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,069 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:27:58,069 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:27:58,069 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:27:58,069 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:27:58,070 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (1/1) ... [2025-03-17 15:27:58,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:27:58,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:27:58,094 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-17 15:27:58,097 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-17 15:27:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:27:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:27:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:27:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:27:58,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:27:58,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:27:58,118 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:27:58,163 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:27:58,165 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:27:58,406 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-03-17 15:27:58,407 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:27:58,421 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:27:58,422 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:27:58,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:58 BoogieIcfgContainer [2025-03-17 15:27:58,422 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:27:58,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:27:58,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:27:58,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:27:58,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:27:57" (1/3) ... [2025-03-17 15:27:58,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243c8beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:58, skipping insertion in model container [2025-03-17 15:27:58,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:27:58" (2/3) ... [2025-03-17 15:27:58,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243c8beb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:27:58, skipping insertion in model container [2025-03-17 15:27:58,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:58" (3/3) ... [2025-03-17 15:27:58,432 INFO L128 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound2.c [2025-03-17 15:27:58,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:27:58,444 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hard2_unwindbound2.c that has 2 procedures, 78 locations, 1 initial locations, 2 loop locations, and 28 error locations. [2025-03-17 15:27:58,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:27:58,490 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;@48449f8d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:27:58,490 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-17 15:27:58,494 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 69 states have internal predecessors, (77), 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-17 15:27:58,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 15:27:58,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:27:58,499 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 15:27:58,499 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:27:58,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:27:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash 107180, now seen corresponding path program 1 times [2025-03-17 15:27:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:27:58,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180523448] [2025-03-17 15:27:58,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:27:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:27:58,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 15:27:58,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 15:27:58,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:27:58,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:27:58,655 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-17 15:27:58,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:27:58,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180523448] [2025-03-17 15:27:58,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180523448] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:27:58,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:27:58,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:27:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161082383] [2025-03-17 15:27:58,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:27:58,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:27:58,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:27:58,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:27:58,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:27:58,677 INFO L87 Difference]: Start difference. First operand has 78 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 69 states have internal predecessors, (77), 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) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:27:58,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:27:58,728 INFO L93 Difference]: Finished difference Result 163 states and 198 transitions. [2025-03-17 15:27:58,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:27:58,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 15:27:58,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:27:58,735 INFO L225 Difference]: With dead ends: 163 [2025-03-17 15:27:58,735 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 15:27:58,737 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-17 15:27:58,740 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 34 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:27:58,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 216 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:27:58,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 15:27:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2025-03-17 15:27:58,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 42 states have (on average 1.7380952380952381) internal successors, (73), 68 states have internal predecessors, (73), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:27:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2025-03-17 15:27:58,768 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 3 [2025-03-17 15:27:58,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:27:58,768 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2025-03-17 15:27:58,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 15:27:58,768 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2025-03-17 15:27:58,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 15:27:58,768 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:27:58,768 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 15:27:58,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:27:58,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:27:58,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:27:58,769 INFO L85 PathProgramCache]: Analyzing trace with hash 3322622, now seen corresponding path program 1 times [2025-03-17 15:27:58,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:27:58,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653675548] [2025-03-17 15:27:58,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:27:58,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:27:58,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 15:27:58,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 15:27:58,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:27:58,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:27:58,814 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-17 15:27:58,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:27:58,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653675548] [2025-03-17 15:27:58,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653675548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:27:58,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:27:58,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:27:58,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651792089] [2025-03-17 15:27:58,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:27:58,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:27:58,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:27:58,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:27:58,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:27:58,817 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. 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-17 15:27:58,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:27:58,853 INFO L93 Difference]: Finished difference Result 131 states and 142 transitions. [2025-03-17 15:27:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:27:58,853 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-17 15:27:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:27:58,854 INFO L225 Difference]: With dead ends: 131 [2025-03-17 15:27:58,854 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 15:27:58,855 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-17 15:27:58,855 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 3 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:27:58,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 223 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:27:58,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 15:27:58,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 15:27:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 46 states have (on average 1.673913043478261) internal successors, (77), 72 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-17 15:27:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2025-03-17 15:27:58,864 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 4 [2025-03-17 15:27:58,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:27:58,864 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2025-03-17 15:27:58,864 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-17 15:27:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2025-03-17 15:27:58,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-17 15:27:58,865 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:27:58,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:27:58,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:27:58,865 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:27:58,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:27:58,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1895308770, now seen corresponding path program 1 times [2025-03-17 15:27:58,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:27:58,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274105241] [2025-03-17 15:27:58,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:27:58,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:27:58,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:27:58,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:27:58,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:27:58,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:27:58,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [115935044] [2025-03-17 15:27:58,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:27:58,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:27:58,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:27:58,892 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-17 15:27:58,893 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-17 15:27:58,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-17 15:27:58,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-17 15:27:58,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:27:58,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:27:58,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:27:58,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:27:58,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 15:27:58,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:27:58,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:27:58,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274105241] [2025-03-17 15:27:58,998 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:27:58,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115935044] [2025-03-17 15:27:58,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115935044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:27:58,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:27:58,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:27:58,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859512185] [2025-03-17 15:27:58,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:27:58,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:27:58,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:27:58,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:27:58,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:27:59,000 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:27:59,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:27:59,059 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2025-03-17 15:27:59,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:27:59,060 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 16 [2025-03-17 15:27:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:27:59,061 INFO L225 Difference]: With dead ends: 169 [2025-03-17 15:27:59,061 INFO L226 Difference]: Without dead ends: 115 [2025-03-17 15:27:59,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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-17 15:27:59,062 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:27:59,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 114 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:27:59,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-17 15:27:59,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 103. [2025-03-17 15:27:59,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.640625) internal successors, (105), 90 states have internal predecessors, (105), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:27:59,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 125 transitions. [2025-03-17 15:27:59,077 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 125 transitions. Word has length 16 [2025-03-17 15:27:59,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:27:59,077 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 125 transitions. [2025-03-17 15:27:59,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 15:27:59,077 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2025-03-17 15:27:59,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 15:27:59,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:27:59,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:27:59,084 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-17 15:27:59,278 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-17 15:27:59,278 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:27:59,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:27:59,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1498999456, now seen corresponding path program 1 times [2025-03-17 15:27:59,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:27:59,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035289302] [2025-03-17 15:27:59,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:27:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:27:59,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:27:59,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:27:59,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:27:59,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:27:59,376 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:27:59,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:27:59,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035289302] [2025-03-17 15:27:59,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035289302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:27:59,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:27:59,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:27:59,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686948] [2025-03-17 15:27:59,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:27:59,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:27:59,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:27:59,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:27:59,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:27:59,377 INFO L87 Difference]: Start difference. First operand 103 states and 125 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:27:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:27:59,423 INFO L93 Difference]: Finished difference Result 115 states and 132 transitions. [2025-03-17 15:27:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:27:59,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-03-17 15:27:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:27:59,424 INFO L225 Difference]: With dead ends: 115 [2025-03-17 15:27:59,424 INFO L226 Difference]: Without dead ends: 113 [2025-03-17 15:27:59,424 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-17 15:27:59,425 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 23 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:27:59,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 125 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:27:59,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-17 15:27:59,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2025-03-17 15:27:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.609375) internal successors, (103), 90 states have internal predecessors, (103), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:27:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2025-03-17 15:27:59,438 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 24 [2025-03-17 15:27:59,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:27:59,439 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2025-03-17 15:27:59,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:27:59,439 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2025-03-17 15:27:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 15:27:59,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:27:59,439 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:27:59,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:27:59,439 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:27:59,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:27:59,440 INFO L85 PathProgramCache]: Analyzing trace with hash -775658310, now seen corresponding path program 1 times [2025-03-17 15:27:59,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:27:59,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512144082] [2025-03-17 15:27:59,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:27:59,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:27:59,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 15:27:59,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 15:27:59,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:27:59,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:27:59,536 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:27:59,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:27:59,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512144082] [2025-03-17 15:27:59,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512144082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:27:59,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:27:59,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:27:59,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350957800] [2025-03-17 15:27:59,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:27:59,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:27:59,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:27:59,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:27:59,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:27:59,539 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:27:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:27:59,599 INFO L93 Difference]: Finished difference Result 103 states and 123 transitions. [2025-03-17 15:27:59,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:27:59,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2025-03-17 15:27:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:27:59,601 INFO L225 Difference]: With dead ends: 103 [2025-03-17 15:27:59,601 INFO L226 Difference]: Without dead ends: 102 [2025-03-17 15:27:59,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:27:59,602 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 134 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:27:59,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 199 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:27:59,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-03-17 15:27:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2025-03-17 15:27:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 64 states have (on average 1.578125) internal successors, (101), 89 states have internal predecessors, (101), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:27:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 121 transitions. [2025-03-17 15:27:59,612 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 121 transitions. Word has length 25 [2025-03-17 15:27:59,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:27:59,612 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 121 transitions. [2025-03-17 15:27:59,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:27:59,614 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2025-03-17 15:27:59,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 15:27:59,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:27:59,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:27:59,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:27:59,615 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:27:59,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:27:59,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1724396183, now seen corresponding path program 1 times [2025-03-17 15:27:59,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:27:59,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253932107] [2025-03-17 15:27:59,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:27:59,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:27:59,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 15:27:59,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 15:27:59,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:27:59,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:27:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:27:59,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:27:59,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253932107] [2025-03-17 15:27:59,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253932107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:27:59,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:27:59,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:27:59,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997271911] [2025-03-17 15:27:59,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:27:59,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:27:59,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:27:59,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:27:59,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:27:59,676 INFO L87 Difference]: Start difference. First operand 102 states and 121 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:27:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:27:59,746 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2025-03-17 15:27:59,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:27:59,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2025-03-17 15:27:59,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:27:59,747 INFO L225 Difference]: With dead ends: 119 [2025-03-17 15:27:59,747 INFO L226 Difference]: Without dead ends: 110 [2025-03-17 15:27:59,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:27:59,749 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 20 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:27:59,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 345 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:27:59,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-17 15:27:59,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 106. [2025-03-17 15:27:59,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 92 states have internal predecessors, (102), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:27:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2025-03-17 15:27:59,761 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 26 [2025-03-17 15:27:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:27:59,761 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2025-03-17 15:27:59,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:27:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2025-03-17 15:27:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 15:27:59,762 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:27:59,762 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:27:59,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 15:27:59,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:27:59,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:27:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash -712643915, now seen corresponding path program 1 times [2025-03-17 15:27:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:27:59,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104513542] [2025-03-17 15:27:59,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:27:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:27:59,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:27:59,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:27:59,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:27:59,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:27:59,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311115304] [2025-03-17 15:27:59,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:27:59,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:27:59,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:27:59,783 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-17 15:27:59,785 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-17 15:27:59,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 15:27:59,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 15:27:59,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:27:59,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:27:59,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 15:27:59,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:27:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:27:59,848 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:27:59,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:27:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104513542] [2025-03-17 15:27:59,849 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:27:59,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311115304] [2025-03-17 15:27:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311115304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:27:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:27:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:27:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375330195] [2025-03-17 15:27:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:27:59,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:27:59,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:27:59,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:27:59,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:27:59,849 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:27:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:27:59,892 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2025-03-17 15:27:59,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:27:59,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2025-03-17 15:27:59,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:27:59,893 INFO L225 Difference]: With dead ends: 145 [2025-03-17 15:27:59,893 INFO L226 Difference]: Without dead ends: 141 [2025-03-17 15:27:59,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 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-17 15:27:59,893 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 43 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:27:59,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:27:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-03-17 15:27:59,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 126. [2025-03-17 15:27:59,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 85 states have (on average 1.5294117647058822) internal successors, (130), 110 states have internal predecessors, (130), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 15:27:59,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 154 transitions. [2025-03-17 15:27:59,899 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 154 transitions. Word has length 28 [2025-03-17 15:27:59,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:27:59,899 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 154 transitions. [2025-03-17 15:27:59,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:27:59,900 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 154 transitions. [2025-03-17 15:27:59,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 15:27:59,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:27:59,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:27:59,906 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-17 15:28:00,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-17 15:28:00,101 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:00,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:00,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1951001901, now seen corresponding path program 1 times [2025-03-17 15:28:00,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:00,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598872802] [2025-03-17 15:28:00,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:00,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:00,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:28:00,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:28:00,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:00,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:28:00,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1745142450] [2025-03-17 15:28:00,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:00,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:00,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:00,127 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:28:00,128 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-17 15:28:00,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:28:00,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:28:00,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:00,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:00,159 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:28:00,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:00,253 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:28:00,253 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:28:00,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598872802] [2025-03-17 15:28:00,253 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:28:00,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745142450] [2025-03-17 15:28:00,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745142450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:00,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:28:00,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:28:00,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073058236] [2025-03-17 15:28:00,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:00,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:28:00,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:00,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:28:00,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:28:00,254 INFO L87 Difference]: Start difference. First operand 126 states and 154 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:28:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:00,308 INFO L93 Difference]: Finished difference Result 139 states and 161 transitions. [2025-03-17 15:28:00,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:28:00,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-17 15:28:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:00,309 INFO L225 Difference]: With dead ends: 139 [2025-03-17 15:28:00,309 INFO L226 Difference]: Without dead ends: 137 [2025-03-17 15:28:00,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-17 15:28:00,310 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 37 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:00,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 92 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:28:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2025-03-17 15:28:00,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 127. [2025-03-17 15:28:00,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 86 states have (on average 1.5) internal successors, (129), 111 states have internal predecessors, (129), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 15:28:00,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 153 transitions. [2025-03-17 15:28:00,317 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 153 transitions. Word has length 30 [2025-03-17 15:28:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:00,317 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 153 transitions. [2025-03-17 15:28:00,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:28:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 153 transitions. [2025-03-17 15:28:00,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 15:28:00,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:00,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:28:00,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 15:28:00,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:00,526 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:00,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:00,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1461404237, now seen corresponding path program 1 times [2025-03-17 15:28:00,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:00,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254524235] [2025-03-17 15:28:00,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:00,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:00,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:28:00,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:28:00,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:00,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:00,590 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:28:00,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254524235] [2025-03-17 15:28:00,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254524235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:28:00,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945528783] [2025-03-17 15:28:00,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:00,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:00,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:00,592 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-17 15:28:00,594 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-17 15:28:00,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 15:28:00,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 15:28:00,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:00,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:00,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:28:00,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:00,685 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:28:00,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:28:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945528783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:00,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:28:00,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-17 15:28:00,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399251979] [2025-03-17 15:28:00,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:00,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:28:00,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:00,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:28:00,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:28:00,687 INFO L87 Difference]: Start difference. First operand 127 states and 153 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:28:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:00,727 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2025-03-17 15:28:00,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:28:00,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 30 [2025-03-17 15:28:00,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:00,729 INFO L225 Difference]: With dead ends: 131 [2025-03-17 15:28:00,729 INFO L226 Difference]: Without dead ends: 130 [2025-03-17 15:28:00,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:28:00,729 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:00,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 260 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:28:00,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-03-17 15:28:00,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2025-03-17 15:28:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 86 states have (on average 1.4883720930232558) internal successors, (128), 110 states have internal predecessors, (128), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 15:28:00,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 152 transitions. [2025-03-17 15:28:00,736 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 152 transitions. Word has length 30 [2025-03-17 15:28:00,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:00,736 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 152 transitions. [2025-03-17 15:28:00,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:28:00,736 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 152 transitions. [2025-03-17 15:28:00,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 15:28:00,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:00,737 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:28:00,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 15:28:00,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:00,937 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:00,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -351516780, now seen corresponding path program 1 times [2025-03-17 15:28:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481930950] [2025-03-17 15:28:00,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:00,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:00,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 15:28:00,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 15:28:00,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:00,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:00,989 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:28:00,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:00,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481930950] [2025-03-17 15:28:00,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481930950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:00,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:28:00,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:28:00,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010121417] [2025-03-17 15:28:00,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:00,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:28:00,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:00,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:28:00,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:28:00,990 INFO L87 Difference]: Start difference. First operand 126 states and 152 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:28:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:01,197 INFO L93 Difference]: Finished difference Result 145 states and 177 transitions. [2025-03-17 15:28:01,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:28:01,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2025-03-17 15:28:01,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:01,198 INFO L225 Difference]: With dead ends: 145 [2025-03-17 15:28:01,198 INFO L226 Difference]: Without dead ends: 144 [2025-03-17 15:28:01,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:28:01,198 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 89 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:01,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 151 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:28:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2025-03-17 15:28:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 134. [2025-03-17 15:28:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 94 states have (on average 1.4787234042553192) internal successors, (139), 118 states have internal predecessors, (139), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 15:28:01,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 163 transitions. [2025-03-17 15:28:01,209 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 163 transitions. Word has length 31 [2025-03-17 15:28:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:01,210 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 163 transitions. [2025-03-17 15:28:01,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:28:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 163 transitions. [2025-03-17 15:28:01,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:28:01,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:01,210 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:28:01,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 15:28:01,210 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:01,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:01,212 INFO L85 PathProgramCache]: Analyzing trace with hash 137076893, now seen corresponding path program 1 times [2025-03-17 15:28:01,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:01,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67947687] [2025-03-17 15:28:01,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:01,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:01,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:28:01,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:28:01,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:01,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:28:01,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:01,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67947687] [2025-03-17 15:28:01,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67947687] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:28:01,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1559380496] [2025-03-17 15:28:01,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:01,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:01,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:01,278 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-17 15:28:01,284 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-17 15:28:01,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:28:01,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:28:01,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:01,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:01,327 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:28:01,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:01,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:28:01,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:28:01,431 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 15:28:01,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1559380496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:28:01,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:28:01,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 6 [2025-03-17 15:28:01,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067547600] [2025-03-17 15:28:01,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:28:01,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 15:28:01,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:01,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 15:28:01,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:28:01,432 INFO L87 Difference]: Start difference. First operand 134 states and 163 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 15:28:01,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:01,485 INFO L93 Difference]: Finished difference Result 216 states and 266 transitions. [2025-03-17 15:28:01,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:28:01,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 34 [2025-03-17 15:28:01,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:01,488 INFO L225 Difference]: With dead ends: 216 [2025-03-17 15:28:01,488 INFO L226 Difference]: Without dead ends: 138 [2025-03-17 15:28:01,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:28:01,488 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 10 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:01,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 228 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:28:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-03-17 15:28:01,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2025-03-17 15:28:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 98 states have (on average 1.4591836734693877) internal successors, (143), 122 states have internal predecessors, (143), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 15:28:01,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 167 transitions. [2025-03-17 15:28:01,497 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 167 transitions. Word has length 34 [2025-03-17 15:28:01,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:01,497 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 167 transitions. [2025-03-17 15:28:01,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-17 15:28:01,497 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 167 transitions. [2025-03-17 15:28:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 15:28:01,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:01,500 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:28:01,506 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-17 15:28:01,700 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-17 15:28:01,701 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:01,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:01,701 INFO L85 PathProgramCache]: Analyzing trace with hash 2107540819, now seen corresponding path program 1 times [2025-03-17 15:28:01,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:01,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009275245] [2025-03-17 15:28:01,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:01,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:01,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:28:01,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:28:01,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:01,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:28:01,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2070991484] [2025-03-17 15:28:01,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:01,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:01,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:01,718 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-17 15:28:01,719 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-17 15:28:01,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 15:28:01,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 15:28:01,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:01,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:01,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:28:01,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:01,846 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:28:01,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:28:01,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:01,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009275245] [2025-03-17 15:28:01,846 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:28:01,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070991484] [2025-03-17 15:28:01,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070991484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:01,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:28:01,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:28:01,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308970655] [2025-03-17 15:28:01,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:01,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:28:01,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:01,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:28:01,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:28:01,847 INFO L87 Difference]: Start difference. First operand 138 states and 167 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:28:01,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:01,915 INFO L93 Difference]: Finished difference Result 173 states and 205 transitions. [2025-03-17 15:28:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:28:01,916 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2025-03-17 15:28:01,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:01,917 INFO L225 Difference]: With dead ends: 173 [2025-03-17 15:28:01,917 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 15:28:01,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 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-17 15:28:01,918 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 76 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:01,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 121 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:28:01,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 15:28:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 147. [2025-03-17 15:28:01,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 109 states have (on average 1.385321100917431) internal successors, (151), 129 states have internal predecessors, (151), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 15:28:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 179 transitions. [2025-03-17 15:28:01,929 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 179 transitions. Word has length 42 [2025-03-17 15:28:01,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:01,929 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 179 transitions. [2025-03-17 15:28:01,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:28:01,929 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 179 transitions. [2025-03-17 15:28:01,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 15:28:01,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:01,930 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:28:01,935 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-17 15:28:02,131 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-17 15:28:02,131 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:02,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:02,132 INFO L85 PathProgramCache]: Analyzing trace with hash 909255983, now seen corresponding path program 1 times [2025-03-17 15:28:02,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:02,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319773293] [2025-03-17 15:28:02,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:02,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:02,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:28:02,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:28:02,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:02,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:28:02,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1574408734] [2025-03-17 15:28:02,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:02,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:02,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:02,144 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-17 15:28:02,146 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-17 15:28:02,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 15:28:02,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 15:28:02,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:02,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:02,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:28:02,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:02,253 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:28:02,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:28:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319773293] [2025-03-17 15:28:02,419 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:28:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574408734] [2025-03-17 15:28:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574408734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:28:02,419 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:28:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2025-03-17 15:28:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503915029] [2025-03-17 15:28:02,420 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 15:28:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:28:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:02,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:28:02,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:28:02,420 INFO L87 Difference]: Start difference. First operand 147 states and 179 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:28:02,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:02,543 INFO L93 Difference]: Finished difference Result 252 states and 317 transitions. [2025-03-17 15:28:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:28:02,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-03-17 15:28:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:02,544 INFO L225 Difference]: With dead ends: 252 [2025-03-17 15:28:02,544 INFO L226 Difference]: Without dead ends: 248 [2025-03-17 15:28:02,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 60 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-17 15:28:02,545 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 64 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:02,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 189 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:28:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2025-03-17 15:28:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 218. [2025-03-17 15:28:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 171 states have (on average 1.4210526315789473) internal successors, (243), 191 states have internal predecessors, (243), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-17 15:28:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 289 transitions. [2025-03-17 15:28:02,558 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 289 transitions. Word has length 43 [2025-03-17 15:28:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:02,558 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 289 transitions. [2025-03-17 15:28:02,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:28:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 289 transitions. [2025-03-17 15:28:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-17 15:28:02,559 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:02,559 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 15:28:02,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 15:28:02,764 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-17 15:28:02,764 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:02,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 704786185, now seen corresponding path program 1 times [2025-03-17 15:28:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339505823] [2025-03-17 15:28:02,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:02,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-17 15:28:02,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-17 15:28:02,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:02,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 15:28:02,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:02,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339505823] [2025-03-17 15:28:02,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339505823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:02,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:28:02,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:28:02,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050191556] [2025-03-17 15:28:02,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:02,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:28:02,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:02,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:28:02,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:28:02,841 INFO L87 Difference]: Start difference. First operand 218 states and 289 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:28:02,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:02,916 INFO L93 Difference]: Finished difference Result 223 states and 293 transitions. [2025-03-17 15:28:02,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:28:02,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 48 [2025-03-17 15:28:02,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:02,917 INFO L225 Difference]: With dead ends: 223 [2025-03-17 15:28:02,917 INFO L226 Difference]: Without dead ends: 205 [2025-03-17 15:28:02,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:28:02,918 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 25 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:02,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 156 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:28:02,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-17 15:28:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2025-03-17 15:28:02,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 160 states have (on average 1.44375) internal successors, (231), 180 states have internal predecessors, (231), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 15:28:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 273 transitions. [2025-03-17 15:28:02,927 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 273 transitions. Word has length 48 [2025-03-17 15:28:02,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:02,927 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 273 transitions. [2025-03-17 15:28:02,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-17 15:28:02,927 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 273 transitions. [2025-03-17 15:28:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-17 15:28:02,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:02,928 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-17 15:28:02,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 15:28:02,928 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:02,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:02,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1765308203, now seen corresponding path program 1 times [2025-03-17 15:28:02,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:02,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814043969] [2025-03-17 15:28:02,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:02,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:02,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 15:28:02,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 15:28:02,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:02,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:02,987 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:28:02,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814043969] [2025-03-17 15:28:02,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814043969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:28:02,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333409713] [2025-03-17 15:28:02,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:02,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:02,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:02,989 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-17 15:28:02,991 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-17 15:28:03,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 15:28:03,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 15:28:03,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:03,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:03,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:28:03,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:03,066 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:28:03,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:28:03,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333409713] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:03,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:28:03,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-17 15:28:03,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65491994] [2025-03-17 15:28:03,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:03,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:28:03,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:03,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:28:03,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:28:03,067 INFO L87 Difference]: Start difference. First operand 205 states and 273 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:28:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:03,130 INFO L93 Difference]: Finished difference Result 306 states and 418 transitions. [2025-03-17 15:28:03,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:28:03,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2025-03-17 15:28:03,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:03,133 INFO L225 Difference]: With dead ends: 306 [2025-03-17 15:28:03,133 INFO L226 Difference]: Without dead ends: 304 [2025-03-17 15:28:03,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 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-17 15:28:03,134 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 57 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:03,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 146 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:28:03,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2025-03-17 15:28:03,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 278. [2025-03-17 15:28:03,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 226 states have (on average 1.4601769911504425) internal successors, (330), 245 states have internal predecessors, (330), 29 states have call successors, (29), 3 states have call predecessors, (29), 3 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 15:28:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 388 transitions. [2025-03-17 15:28:03,149 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 388 transitions. Word has length 50 [2025-03-17 15:28:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:03,149 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 388 transitions. [2025-03-17 15:28:03,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 15:28:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 388 transitions. [2025-03-17 15:28:03,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 15:28:03,150 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:03,150 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-17 15:28:03,156 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 15:28:03,350 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,SelfDestructingSolverStorable14 [2025-03-17 15:28:03,351 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:03,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:03,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1110020582, now seen corresponding path program 1 times [2025-03-17 15:28:03,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:03,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092613272] [2025-03-17 15:28:03,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:03,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:03,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:28:03,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:28:03,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:03,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:03,410 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:28:03,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092613272] [2025-03-17 15:28:03,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092613272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:28:03,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98090578] [2025-03-17 15:28:03,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:03,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:03,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:03,413 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-17 15:28:03,414 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-17 15:28:03,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 15:28:03,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 15:28:03,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:03,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:03,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 15:28:03,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:28:03,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:28:03,532 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:28:03,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98090578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:28:03,532 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:28:03,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 15:28:03,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389312408] [2025-03-17 15:28:03,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:28:03,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:28:03,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:03,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:28:03,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:28:03,535 INFO L87 Difference]: Start difference. First operand 278 states and 388 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-17 15:28:03,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:03,666 INFO L93 Difference]: Finished difference Result 463 states and 637 transitions. [2025-03-17 15:28:03,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:28:03,668 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) Word has length 51 [2025-03-17 15:28:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:03,669 INFO L225 Difference]: With dead ends: 463 [2025-03-17 15:28:03,669 INFO L226 Difference]: Without dead ends: 461 [2025-03-17 15:28:03,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:28:03,670 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 129 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:03,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 276 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:28:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-03-17 15:28:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 402. [2025-03-17 15:28:03,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 334 states have (on average 1.464071856287425) internal successors, (489), 353 states have internal predecessors, (489), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-17 15:28:03,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 579 transitions. [2025-03-17 15:28:03,701 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 579 transitions. Word has length 51 [2025-03-17 15:28:03,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:03,701 INFO L471 AbstractCegarLoop]: Abstraction has 402 states and 579 transitions. [2025-03-17 15:28:03,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 5 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 5 states have call predecessors, (15), 5 states have call successors, (15) [2025-03-17 15:28:03,701 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 579 transitions. [2025-03-17 15:28:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-17 15:28:03,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:03,701 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:28:03,707 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 15:28:03,902 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,SelfDestructingSolverStorable15 [2025-03-17 15:28:03,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:03,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:03,902 INFO L85 PathProgramCache]: Analyzing trace with hash 50861964, now seen corresponding path program 1 times [2025-03-17 15:28:03,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:03,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750466448] [2025-03-17 15:28:03,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:03,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:03,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 15:28:03,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 15:28:03,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:03,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:03,974 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:28:03,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:03,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750466448] [2025-03-17 15:28:03,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750466448] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:28:03,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916338971] [2025-03-17 15:28:03,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:03,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:03,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:03,977 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-17 15:28:03,977 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-17 15:28:03,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-17 15:28:04,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-17 15:28:04,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:04,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:04,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:28:04,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:04,092 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 43 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:28:04,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:28:04,182 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-17 15:28:04,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916338971] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:28:04,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:28:04,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-17 15:28:04,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536140742] [2025-03-17 15:28:04,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:28:04,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 15:28:04,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:04,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 15:28:04,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2025-03-17 15:28:04,183 INFO L87 Difference]: Start difference. First operand 402 states and 579 transitions. Second operand has 17 states, 16 states have (on average 4.375) internal successors, (70), 17 states have internal predecessors, (70), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-17 15:28:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:04,371 INFO L93 Difference]: Finished difference Result 608 states and 850 transitions. [2025-03-17 15:28:04,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 15:28:04,371 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 17 states have internal predecessors, (70), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) Word has length 52 [2025-03-17 15:28:04,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:04,374 INFO L225 Difference]: With dead ends: 608 [2025-03-17 15:28:04,374 INFO L226 Difference]: Without dead ends: 607 [2025-03-17 15:28:04,374 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2025-03-17 15:28:04,376 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 239 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:04,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 609 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:28:04,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2025-03-17 15:28:04,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 573. [2025-03-17 15:28:04,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 491 states have (on average 1.4215885947046842) internal successors, (698), 510 states have internal predecessors, (698), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 15:28:04,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 812 transitions. [2025-03-17 15:28:04,399 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 812 transitions. Word has length 52 [2025-03-17 15:28:04,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:04,400 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 812 transitions. [2025-03-17 15:28:04,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.375) internal successors, (70), 17 states have internal predecessors, (70), 5 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 5 states have call predecessors, (18), 5 states have call successors, (18) [2025-03-17 15:28:04,400 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 812 transitions. [2025-03-17 15:28:04,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 15:28:04,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:04,400 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 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-17 15:28:04,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-17 15:28:04,604 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,SelfDestructingSolverStorable16 [2025-03-17 15:28:04,604 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:04,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash -785624384, now seen corresponding path program 1 times [2025-03-17 15:28:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647265156] [2025-03-17 15:28:04,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:04,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 15:28:04,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 15:28:04,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:04,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 15:28:04,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2006106955] [2025-03-17 15:28:04,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:04,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:04,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:04,623 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-17 15:28:04,625 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-17 15:28:04,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 15:28:04,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 15:28:04,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:04,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:04,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 15:28:04,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-17 15:28:04,753 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:28:04,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:04,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647265156] [2025-03-17 15:28:04,753 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 15:28:04,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006106955] [2025-03-17 15:28:04,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006106955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:04,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:28:04,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:28:04,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432303077] [2025-03-17 15:28:04,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:04,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:28:04,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:04,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:28:04,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:28:04,755 INFO L87 Difference]: Start difference. First operand 573 states and 812 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:28:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:04,807 INFO L93 Difference]: Finished difference Result 604 states and 861 transitions. [2025-03-17 15:28:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:28:04,808 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 57 [2025-03-17 15:28:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:04,810 INFO L225 Difference]: With dead ends: 604 [2025-03-17 15:28:04,810 INFO L226 Difference]: Without dead ends: 599 [2025-03-17 15:28:04,810 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 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-17 15:28:04,810 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:04,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 83 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:28:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-17 15:28:04,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 570. [2025-03-17 15:28:04,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 488 states have (on average 1.3811475409836065) internal successors, (674), 507 states have internal predecessors, (674), 57 states have call successors, (57), 5 states have call predecessors, (57), 5 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 15:28:04,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 788 transitions. [2025-03-17 15:28:04,831 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 788 transitions. Word has length 57 [2025-03-17 15:28:04,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:04,831 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 788 transitions. [2025-03-17 15:28:04,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-17 15:28:04,831 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 788 transitions. [2025-03-17 15:28:04,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-17 15:28:04,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:04,832 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2025-03-17 15:28:04,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-17 15:28:05,032 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,SelfDestructingSolverStorable17 [2025-03-17 15:28:05,032 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:05,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:05,033 INFO L85 PathProgramCache]: Analyzing trace with hash -858511142, now seen corresponding path program 2 times [2025-03-17 15:28:05,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:05,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329445272] [2025-03-17 15:28:05,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:28:05,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:05,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-17 15:28:05,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:28:05,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:28:05,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:28:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329445272] [2025-03-17 15:28:05,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329445272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:28:05,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367917300] [2025-03-17 15:28:05,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:28:05,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:05,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:28:05,156 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-17 15:28:05,158 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-17 15:28:05,177 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 69 statements into 2 equivalence classes. [2025-03-17 15:28:05,193 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 69 of 69 statements. [2025-03-17 15:28:05,193 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:28:05,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:05,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-17 15:28:05,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:28:05,261 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 112 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:28:05,261 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:28:05,335 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:28:05,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367917300] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:28:05,336 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:28:05,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 9 [2025-03-17 15:28:05,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722860408] [2025-03-17 15:28:05,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:28:05,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:28:05,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:05,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:28:05,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:28:05,337 INFO L87 Difference]: Start difference. First operand 570 states and 788 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 15:28:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:05,403 INFO L93 Difference]: Finished difference Result 704 states and 955 transitions. [2025-03-17 15:28:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:28:05,403 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 69 [2025-03-17 15:28:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:05,405 INFO L225 Difference]: With dead ends: 704 [2025-03-17 15:28:05,405 INFO L226 Difference]: Without dead ends: 290 [2025-03-17 15:28:05,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 133 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-03-17 15:28:05,406 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 15 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:05,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 339 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:28:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-17 15:28:05,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2025-03-17 15:28:05,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 243 states have (on average 1.337448559670782) internal successors, (325), 258 states have internal predecessors, (325), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 15:28:05,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 377 transitions. [2025-03-17 15:28:05,420 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 377 transitions. Word has length 69 [2025-03-17 15:28:05,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:05,420 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 377 transitions. [2025-03-17 15:28:05,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 3 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-17 15:28:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 377 transitions. [2025-03-17 15:28:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-17 15:28:05,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:05,421 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 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] [2025-03-17 15:28:05,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 15:28:05,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:28:05,622 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:05,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:05,623 INFO L85 PathProgramCache]: Analyzing trace with hash -348731704, now seen corresponding path program 1 times [2025-03-17 15:28:05,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:05,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184151618] [2025-03-17 15:28:05,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:05,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:05,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-17 15:28:05,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-17 15:28:05,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:05,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:05,665 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 15:28:05,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:05,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184151618] [2025-03-17 15:28:05,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184151618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:05,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:28:05,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 15:28:05,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377484428] [2025-03-17 15:28:05,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:05,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:28:05,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:05,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:28:05,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:28:05,667 INFO L87 Difference]: Start difference. First operand 290 states and 377 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:28:05,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:05,697 INFO L93 Difference]: Finished difference Result 316 states and 390 transitions. [2025-03-17 15:28:05,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:28:05,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 72 [2025-03-17 15:28:05,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:05,698 INFO L225 Difference]: With dead ends: 316 [2025-03-17 15:28:05,698 INFO L226 Difference]: Without dead ends: 182 [2025-03-17 15:28:05,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 15:28:05,699 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 2 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:05,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 242 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:28:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2025-03-17 15:28:05,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2025-03-17 15:28:05,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 147 states have (on average 1.2789115646258504) internal successors, (188), 160 states have internal predecessors, (188), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 15:28:05,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 220 transitions. [2025-03-17 15:28:05,707 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 220 transitions. Word has length 72 [2025-03-17 15:28:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:05,708 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 220 transitions. [2025-03-17 15:28:05,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 15:28:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 220 transitions. [2025-03-17 15:28:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-17 15:28:05,708 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:05,708 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-17 15:28:05,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 15:28:05,709 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:05,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:05,709 INFO L85 PathProgramCache]: Analyzing trace with hash 484685085, now seen corresponding path program 1 times [2025-03-17 15:28:05,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:05,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916708167] [2025-03-17 15:28:05,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:05,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-17 15:28:05,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-17 15:28:05,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:05,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-17 15:28:05,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:05,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916708167] [2025-03-17 15:28:05,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916708167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:05,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:28:05,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 15:28:05,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207904520] [2025-03-17 15:28:05,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:05,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 15:28:05,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:05,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 15:28:05,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 15:28:05,755 INFO L87 Difference]: Start difference. First operand 182 states and 220 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:28:05,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:05,782 INFO L93 Difference]: Finished difference Result 182 states and 220 transitions. [2025-03-17 15:28:05,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 15:28:05,783 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76 [2025-03-17 15:28:05,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:05,784 INFO L225 Difference]: With dead ends: 182 [2025-03-17 15:28:05,784 INFO L226 Difference]: Without dead ends: 181 [2025-03-17 15:28:05,784 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-17 15:28:05,784 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:05,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 101 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:28:05,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2025-03-17 15:28:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2025-03-17 15:28:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 147 states have (on average 1.2585034013605443) internal successors, (185), 159 states have internal predecessors, (185), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 15:28:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 217 transitions. [2025-03-17 15:28:05,794 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 217 transitions. Word has length 76 [2025-03-17 15:28:05,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:05,794 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 217 transitions. [2025-03-17 15:28:05,794 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, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-17 15:28:05,794 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 217 transitions. [2025-03-17 15:28:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-03-17 15:28:05,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:28:05,794 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2025-03-17 15:28:05,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 15:28:05,795 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 25 more)] === [2025-03-17 15:28:05,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:28:05,795 INFO L85 PathProgramCache]: Analyzing trace with hash 2140335732, now seen corresponding path program 1 times [2025-03-17 15:28:05,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:28:05,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785891208] [2025-03-17 15:28:05,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:28:05,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:28:05,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-03-17 15:28:05,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-03-17 15:28:05,810 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:28:05,810 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:28:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-17 15:28:05,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:28:05,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785891208] [2025-03-17 15:28:05,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785891208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:28:05,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:28:05,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 15:28:05,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095331354] [2025-03-17 15:28:05,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:28:05,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:28:05,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:28:05,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:28:05,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:28:05,893 INFO L87 Difference]: Start difference. First operand 181 states and 217 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:28:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:28:05,947 INFO L93 Difference]: Finished difference Result 181 states and 217 transitions. [2025-03-17 15:28:05,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:28:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 77 [2025-03-17 15:28:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:28:05,948 INFO L225 Difference]: With dead ends: 181 [2025-03-17 15:28:05,948 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:28:05,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:28:05,949 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 20 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:28:05,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 123 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:28:05,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:28:05,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:28:05,950 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-17 15:28:05,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:28:05,950 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 77 [2025-03-17 15:28:05,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:28:05,950 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:28:05,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 8 states have internal predecessors, (40), 3 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-17 15:28:05,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:28:05,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:28:05,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 28 remaining) [2025-03-17 15:28:05,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 28 remaining) [2025-03-17 15:28:05,952 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 28 remaining) [2025-03-17 15:28:05,953 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 28 remaining) [2025-03-17 15:28:05,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 15:28:05,955 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:28:05,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:28:06,184 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 15:28:06,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 03:28:06 BoogieIcfgContainer [2025-03-17 15:28:06,196 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 15:28:06,196 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 15:28:06,196 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 15:28:06,197 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 15:28:06,197 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:27:58" (3/4) ... [2025-03-17 15:28:06,199 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 15:28:06,202 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-17 15:28:06,208 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-17 15:28:06,208 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-17 15:28:06,209 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-17 15:28:06,209 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:28:06,209 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 15:28:06,279 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 15:28:06,280 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 15:28:06,280 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 15:28:06,281 INFO L158 Benchmark]: Toolchain (without parser) took 8443.79ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 123.7MB in the beginning and 277.6MB in the end (delta: -153.9MB). Peak memory consumption was 34.1MB. Max. memory is 16.1GB. [2025-03-17 15:28:06,283 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:28:06,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.27ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 112.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 15:28:06,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.34ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:28:06,284 INFO L158 Benchmark]: Boogie Preprocessor took 20.24ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.3MB in the end (delta: 715.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:28:06,284 INFO L158 Benchmark]: IcfgBuilder took 353.18ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 93.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 15:28:06,284 INFO L158 Benchmark]: TraceAbstraction took 7771.40ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 92.6MB in the beginning and 284.2MB in the end (delta: -191.6MB). Peak memory consumption was 497.6kB. Max. memory is 16.1GB. [2025-03-17 15:28:06,284 INFO L158 Benchmark]: Witness Printer took 84.07ms. Allocated memory is still 360.7MB. Free memory was 284.2MB in the beginning and 277.6MB in the end (delta: 6.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 15:28:06,285 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.25ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.27ms. Allocated memory is still 167.8MB. Free memory was 123.7MB in the beginning and 112.9MB in the end (delta: 10.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.34ms. Allocated memory is still 167.8MB. Free memory was 112.9MB in the beginning and 111.0MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.24ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 110.3MB in the end (delta: 715.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 353.18ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 93.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 7771.40ms. Allocated memory was 167.8MB in the beginning and 360.7MB in the end (delta: 192.9MB). Free memory was 92.6MB in the beginning and 284.2MB in the end (delta: -191.6MB). Peak memory consumption was 497.6kB. Max. memory is 16.1GB. * Witness Printer took 84.07ms. Allocated memory is still 360.7MB. Free memory was 284.2MB in the beginning and 277.6MB in the end (delta: 6.6MB). There was no memory consumed. 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: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 54]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 46]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 41]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 40]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 98 edges, 28 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 22, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1132 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1091 mSDsluCounter, 4438 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2970 mSDsCounter, 89 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1246 IncrementalHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 89 mSolverCounterUnsat, 1468 mSDtfsCounter, 1246 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 824 GetRequests, 697 SyntacticMatches, 9 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=573occurred in iteration=17, InterpolantAutomatonStates: 129, 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, 22 MinimizatonAttempts, 265 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1348 ConstructedInterpolants, 0 QuantifiedInterpolants, 3254 SizeOfPredicates, 16 NumberOfNonLiveVariables, 1441 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 32 InterpolantComputations, 17 PerfectInterpolantSequences, 1567/1703 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 28 specifications checked. All of them hold - InvariantResult [Line: 34]: Location Invariant Derived location invariant: (((((((((d == 1) && (p == 1)) && (r <= 2147483647)) && (q == 0)) && (counter == 0)) && (B == 1)) && (0 <= (r + 2147483648))) || (((((((r <= 2147483647) && (2 == p)) && (q == 0)) && (counter == 1)) && (B == 1)) && (2 == d)) && (0 <= (r + 2147483648)))) || ((((((((r <= 2147483647) && (d <= 536870911)) && (2 <= p)) && (2 <= d)) && (q == 0)) && (B == 1)) && (counter == 2)) && (0 <= (r + 2147483648)))) - InvariantResult [Line: 23]: Location Invariant Derived location invariant: ((((((((((counter == 3) && (d <= 1073741823)) && (r <= 2147483647)) && (2 <= p)) && (2 <= d)) && (q == 0)) && (B == 1)) && (0 <= (r + 2147483648))) || (((((((r <= 2147483647) && (2 == p)) && (q == 0)) && (B == 1)) && (2 == d)) && (counter == 2)) && (0 <= (r + 2147483648)))) || (((((((d == 1) && (p == 1)) && (q == 0)) && (r <= 0)) && (counter == 1)) && (B == 1)) && (0 <= (r + 2147483648)))) RESULT: Ultimate proved your program to be correct! [2025-03-17 15:28:06,303 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