./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound50.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/lcm1_unwindbound50.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 6ac61a60e8702da390cdc74b87fa3424e0fd152a4ccfcd2c9fd7af24a4bb7ac5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 15:29:55,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 15:29:55,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 15:29:55,839 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 15:29:55,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 15:29:55,864 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 15:29:55,865 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 15:29:55,865 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 15:29:55,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 15:29:55,865 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 15:29:55,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 15:29:55,865 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 15:29:55,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 15:29:55,866 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 15:29:55,866 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 15:29:55,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:29:55,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 15:29:55,867 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 15:29:55,867 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 -> 6ac61a60e8702da390cdc74b87fa3424e0fd152a4ccfcd2c9fd7af24a4bb7ac5 [2025-03-17 15:29:56,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 15:29:56,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 15:29:56,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 15:29:56,139 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 15:29:56,140 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 15:29:56,142 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound50.c [2025-03-17 15:29:57,307 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e0c67c1/d1abbe3ba1174457bddca54bc202d504/FLAGb2522e896 [2025-03-17 15:29:57,610 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 15:29:57,611 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound50.c [2025-03-17 15:29:57,618 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e0c67c1/d1abbe3ba1174457bddca54bc202d504/FLAGb2522e896 [2025-03-17 15:29:57,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4e0c67c1/d1abbe3ba1174457bddca54bc202d504 [2025-03-17 15:29:57,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 15:29:57,908 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 15:29:57,909 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 15:29:57,910 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 15:29:57,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 15:29:57,915 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:29:57" (1/1) ... [2025-03-17 15:29:57,916 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c0ca72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:57, skipping insertion in model container [2025-03-17 15:29:57,916 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 03:29:57" (1/1) ... [2025-03-17 15:29:57,931 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 15:29:58,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:29:58,076 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 15:29:58,095 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 15:29:58,110 INFO L204 MainTranslator]: Completed translation [2025-03-17 15:29:58,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58 WrapperNode [2025-03-17 15:29:58,111 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 15:29:58,112 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 15:29:58,112 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 15:29:58,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 15:29:58,117 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:29:58" (1/1) ... [2025-03-17 15:29:58,127 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:29:58" (1/1) ... [2025-03-17 15:29:58,142 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-03-17 15:29:58,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 15:29:58,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 15:29:58,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 15:29:58,144 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 15:29:58,150 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,167 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2025-03-17 15:29:58,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,173 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,177 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,179 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 15:29:58,179 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 15:29:58,181 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 15:29:58,182 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 15:29:58,183 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (1/1) ... [2025-03-17 15:29:58,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 15:29:58,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:29:58,213 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:29:58,216 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:29:58,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 15:29:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 15:29:58,235 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 15:29:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 15:29:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 15:29:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 15:29:58,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 15:29:58,235 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 15:29:58,235 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 15:29:58,287 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 15:29:58,289 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 15:29:58,466 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2025-03-17 15:29:58,466 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 15:29:58,474 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 15:29:58,475 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 15:29:58,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:29:58 BoogieIcfgContainer [2025-03-17 15:29:58,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 15:29:58,477 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 15:29:58,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 15:29:58,480 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 15:29:58,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 03:29:57" (1/3) ... [2025-03-17 15:29:58,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736f22f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:29:58, skipping insertion in model container [2025-03-17 15:29:58,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 03:29:58" (2/3) ... [2025-03-17 15:29:58,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@736f22f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 03:29:58, skipping insertion in model container [2025-03-17 15:29:58,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 03:29:58" (3/3) ... [2025-03-17 15:29:58,482 INFO L128 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound50.c [2025-03-17 15:29:58,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 15:29:58,495 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lcm1_unwindbound50.c that has 3 procedures, 43 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-17 15:29:58,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 15:29:58,543 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;@34973a88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 15:29:58,544 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 15:29:58,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.68) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:29:58,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 15:29:58,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:58,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:29:58,552 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:58,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:58,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1517090083, now seen corresponding path program 1 times [2025-03-17 15:29:58,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:58,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550557545] [2025-03-17 15:29:58,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:58,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:58,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 15:29:58,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 15:29:58,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:58,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:58,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550557545] [2025-03-17 15:29:58,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550557545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:58,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:58,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 15:29:58,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863143725] [2025-03-17 15:29:58,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:58,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:29:58,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:58,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:29:58,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:29:58,846 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.68) internal successors, (42), 31 states have internal predecessors, (42), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:29:58,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:58,920 INFO L93 Difference]: Finished difference Result 88 states and 134 transitions. [2025-03-17 15:29:58,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 15:29:58,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2025-03-17 15:29:58,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:58,928 INFO L225 Difference]: With dead ends: 88 [2025-03-17 15:29:58,928 INFO L226 Difference]: Without dead ends: 42 [2025-03-17 15:29:58,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:29:58,935 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 11 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:58,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 132 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:29:58,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-17 15:29:58,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2025-03-17 15:29:58,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 31 states have internal predecessors, (36), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 15:29:58,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2025-03-17 15:29:58,977 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 24 [2025-03-17 15:29:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:58,979 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2025-03-17 15:29:58,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 15:29:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2025-03-17 15:29:58,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 15:29:58,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:58,980 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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:29:58,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 15:29:58,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:58,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:58,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1022088843, now seen corresponding path program 1 times [2025-03-17 15:29:58,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:58,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484762501] [2025-03-17 15:29:58,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:58,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 15:29:59,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 15:29:59,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:59,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:59,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:59,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484762501] [2025-03-17 15:29:59,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484762501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:59,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:59,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:29:59,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870224508] [2025-03-17 15:29:59,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:59,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:29:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:59,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:29:59,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:29:59,178 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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:29:59,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:59,275 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2025-03-17 15:29:59,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 15:29:59,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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 34 [2025-03-17 15:29:59,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:59,278 INFO L225 Difference]: With dead ends: 61 [2025-03-17 15:29:59,278 INFO L226 Difference]: Without dead ends: 60 [2025-03-17 15:29:59,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:29:59,279 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 28 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:59,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 153 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:29:59,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-17 15:29:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2025-03-17 15:29:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 41 states have internal predecessors, (49), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:29:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2025-03-17 15:29:59,293 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 34 [2025-03-17 15:29:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:59,293 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2025-03-17 15:29:59,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 7 states have internal predecessors, (15), 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:29:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2025-03-17 15:29:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 15:29:59,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:59,294 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 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:29:59,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 15:29:59,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:59,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1619983068, now seen corresponding path program 1 times [2025-03-17 15:29:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:59,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349067913] [2025-03-17 15:29:59,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:59,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 15:29:59,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 15:29:59,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:59,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:29:59,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:59,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349067913] [2025-03-17 15:29:59,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349067913] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:59,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:59,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 15:29:59,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229945180] [2025-03-17 15:29:59,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:59,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 15:29:59,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:59,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 15:29:59,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:29:59,454 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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:29:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:59,559 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2025-03-17 15:29:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 15:29:59,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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 35 [2025-03-17 15:29:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:59,561 INFO L225 Difference]: With dead ends: 90 [2025-03-17 15:29:59,561 INFO L226 Difference]: Without dead ends: 62 [2025-03-17 15:29:59,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:29:59,562 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 17 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:59,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 160 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:29:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-17 15:29:59,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-17 15:29:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.302325581395349) internal successors, (56), 48 states have internal predecessors, (56), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-17 15:29:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2025-03-17 15:29:59,572 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 35 [2025-03-17 15:29:59,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:59,572 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2025-03-17 15:29:59,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 states have internal predecessors, (16), 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:29:59,572 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2025-03-17 15:29:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-17 15:29:59,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:59,574 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:29:59,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 15:29:59,575 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:59,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:59,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1051691262, now seen corresponding path program 1 times [2025-03-17 15:29:59,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:59,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925809856] [2025-03-17 15:29:59,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:59,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:59,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-17 15:29:59,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-17 15:29:59,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:59,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:29:59,734 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:29:59,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:29:59,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925809856] [2025-03-17 15:29:59,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925809856] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:29:59,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:29:59,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 15:29:59,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568952992] [2025-03-17 15:29:59,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:29:59,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:29:59,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:29:59,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:29:59,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:29:59,736 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:29:59,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:29:59,952 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-03-17 15:29:59,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:29:59,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2025-03-17 15:29:59,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:29:59,953 INFO L225 Difference]: With dead ends: 80 [2025-03-17 15:29:59,953 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 15:29:59,954 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:29:59,954 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 40 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:29:59,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 209 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:29:59,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 15:29:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2025-03-17 15:29:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 51 states have (on average 1.3137254901960784) internal successors, (67), 56 states have internal predecessors, (67), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-17 15:29:59,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2025-03-17 15:29:59,965 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 44 [2025-03-17 15:29:59,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:29:59,965 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2025-03-17 15:29:59,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:29:59,965 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2025-03-17 15:29:59,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 15:29:59,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:29:59,966 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:29:59,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 15:29:59,966 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:29:59,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:29:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash -1757309266, now seen corresponding path program 1 times [2025-03-17 15:29:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:29:59,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762700569] [2025-03-17 15:29:59,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:29:59,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:29:59,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:29:59,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:29:59,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:29:59,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:30:00,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:00,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762700569] [2025-03-17 15:30:00,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762700569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:00,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:00,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 15:30:00,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143341840] [2025-03-17 15:30:00,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:00,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 15:30:00,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:00,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 15:30:00,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 15:30:00,114 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:30:00,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:00,302 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2025-03-17 15:30:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 15:30:00,302 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 45 [2025-03-17 15:30:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:00,303 INFO L225 Difference]: With dead ends: 114 [2025-03-17 15:30:00,303 INFO L226 Difference]: Without dead ends: 86 [2025-03-17 15:30:00,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-03-17 15:30:00,304 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 28 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:00,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 198 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-17 15:30:00,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2025-03-17 15:30:00,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 59 states have (on average 1.2881355932203389) internal successors, (76), 64 states have internal predecessors, (76), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 15:30:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 98 transitions. [2025-03-17 15:30:00,311 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 98 transitions. Word has length 45 [2025-03-17 15:30:00,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:00,311 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 98 transitions. [2025-03-17 15:30:00,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 15:30:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 98 transitions. [2025-03-17 15:30:00,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 15:30:00,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:00,312 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:00,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 15:30:00,313 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:00,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1757236775, now seen corresponding path program 1 times [2025-03-17 15:30:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:00,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063610417] [2025-03-17 15:30:00,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:00,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:00,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:30:00,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:30:00,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:00,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:00,446 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:30:00,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063610417] [2025-03-17 15:30:00,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063610417] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:00,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392718606] [2025-03-17 15:30:00,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:00,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:00,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:00,451 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:30:00,455 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:30:00,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 15:30:00,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 15:30:00,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:00,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:00,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 15:30:00,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:00,637 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:00,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:00,759 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-17 15:30:00,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392718606] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:00,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:00,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-17 15:30:00,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135298037] [2025-03-17 15:30:00,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:00,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 15:30:00,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:00,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 15:30:00,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-17 15:30:00,762 INFO L87 Difference]: Start difference. First operand 82 states and 98 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 15:30:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:01,231 INFO L93 Difference]: Finished difference Result 232 states and 282 transitions. [2025-03-17 15:30:01,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:30:01,232 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) Word has length 45 [2025-03-17 15:30:01,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:01,235 INFO L225 Difference]: With dead ends: 232 [2025-03-17 15:30:01,235 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 15:30:01,236 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=263, Invalid=667, Unknown=0, NotChecked=0, Total=930 [2025-03-17 15:30:01,236 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 175 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:01,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 224 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 15:30:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 15:30:01,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 162. [2025-03-17 15:30:01,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 129 states have internal predecessors, (158), 18 states have call successors, (18), 14 states have call predecessors, (18), 14 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2025-03-17 15:30:01,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2025-03-17 15:30:01,260 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 45 [2025-03-17 15:30:01,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:01,261 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2025-03-17 15:30:01,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 8 states have call predecessors, (14), 8 states have call successors, (14) [2025-03-17 15:30:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2025-03-17 15:30:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-17 15:30:01,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:01,263 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:01,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 15:30:01,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 15:30:01,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:01,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:01,465 INFO L85 PathProgramCache]: Analyzing trace with hash 38535006, now seen corresponding path program 1 times [2025-03-17 15:30:01,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:01,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647276606] [2025-03-17 15:30:01,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:01,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:01,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-17 15:30:01,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-17 15:30:01,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:01,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:30:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647276606] [2025-03-17 15:30:01,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647276606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:01,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:01,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:30:01,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791351251] [2025-03-17 15:30:01,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:01,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:01,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:01,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:30:01,551 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:30:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:01,598 INFO L93 Difference]: Finished difference Result 269 states and 328 transitions. [2025-03-17 15:30:01,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:01,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 54 [2025-03-17 15:30:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:01,600 INFO L225 Difference]: With dead ends: 269 [2025-03-17 15:30:01,600 INFO L226 Difference]: Without dead ends: 204 [2025-03-17 15:30:01,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:30:01,601 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 32 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:01,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 134 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:01,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-17 15:30:01,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 182. [2025-03-17 15:30:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 140 states have (on average 1.292857142857143) internal successors, (181), 145 states have internal predecessors, (181), 22 states have call successors, (22), 14 states have call predecessors, (22), 14 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 15:30:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 225 transitions. [2025-03-17 15:30:01,619 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 225 transitions. Word has length 54 [2025-03-17 15:30:01,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:01,620 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 225 transitions. [2025-03-17 15:30:01,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 3 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-17 15:30:01,620 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 225 transitions. [2025-03-17 15:30:01,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-17 15:30:01,621 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:01,621 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:01,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 15:30:01,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:01,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1194620940, now seen corresponding path program 1 times [2025-03-17 15:30:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:01,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648139962] [2025-03-17 15:30:01,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:01,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:01,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:30:01,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:30:01,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:01,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:01,745 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:30:01,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:01,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648139962] [2025-03-17 15:30:01,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648139962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:01,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508334051] [2025-03-17 15:30:01,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:01,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:01,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:01,747 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:30:01,748 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:30:01,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-17 15:30:01,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-17 15:30:01,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:01,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:01,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:30:01,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:01,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:02,078 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:30:02,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508334051] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:02,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:02,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-17 15:30:02,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926047474] [2025-03-17 15:30:02,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:02,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 15:30:02,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:02,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 15:30:02,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-17 15:30:02,080 INFO L87 Difference]: Start difference. First operand 182 states and 225 transitions. Second operand has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 15:30:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:02,972 INFO L93 Difference]: Finished difference Result 378 states and 472 transitions. [2025-03-17 15:30:02,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-17 15:30:02,972 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) Word has length 55 [2025-03-17 15:30:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:02,975 INFO L225 Difference]: With dead ends: 378 [2025-03-17 15:30:02,975 INFO L226 Difference]: Without dead ends: 295 [2025-03-17 15:30:02,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=507, Invalid=1943, Unknown=0, NotChecked=0, Total=2450 [2025-03-17 15:30:02,979 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 179 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:02,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 238 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 15:30:02,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2025-03-17 15:30:02,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 262. [2025-03-17 15:30:02,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 205 states have (on average 1.278048780487805) internal successors, (262), 210 states have internal predecessors, (262), 29 states have call successors, (29), 22 states have call predecessors, (29), 22 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2025-03-17 15:30:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 320 transitions. [2025-03-17 15:30:02,995 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 320 transitions. Word has length 55 [2025-03-17 15:30:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:02,995 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 320 transitions. [2025-03-17 15:30:02,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.9583333333333335) internal successors, (71), 25 states have internal predecessors, (71), 11 states have call successors, (17), 4 states have call predecessors, (17), 4 states have return successors, (17), 11 states have call predecessors, (17), 11 states have call successors, (17) [2025-03-17 15:30:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 320 transitions. [2025-03-17 15:30:02,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-17 15:30:02,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:02,996 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:03,005 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:30:03,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-17 15:30:03,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:03,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:03,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1833773530, now seen corresponding path program 1 times [2025-03-17 15:30:03,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:03,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140907680] [2025-03-17 15:30:03,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:03,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:03,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 15:30:03,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 15:30:03,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:03,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:30:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:03,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140907680] [2025-03-17 15:30:03,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140907680] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:03,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935005124] [2025-03-17 15:30:03,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:03,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:03,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:03,335 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:30:03,337 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:30:03,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 15:30:03,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 15:30:03,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:03,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:03,383 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 15:30:03,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:03,465 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:03,465 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:03,602 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-17 15:30:03,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935005124] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:03,602 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:03,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2025-03-17 15:30:03,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521824877] [2025-03-17 15:30:03,602 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:03,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 15:30:03,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:03,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 15:30:03,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-03-17 15:30:03,604 INFO L87 Difference]: Start difference. First operand 262 states and 320 transitions. Second operand has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-17 15:30:04,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:04,145 INFO L93 Difference]: Finished difference Result 470 states and 580 transitions. [2025-03-17 15:30:04,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 15:30:04,146 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) Word has length 58 [2025-03-17 15:30:04,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:04,147 INFO L225 Difference]: With dead ends: 470 [2025-03-17 15:30:04,147 INFO L226 Difference]: Without dead ends: 331 [2025-03-17 15:30:04,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 15:30:04,149 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 110 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:04,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 328 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:30:04,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-17 15:30:04,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 322. [2025-03-17 15:30:04,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 257 states have (on average 1.245136186770428) internal successors, (320), 262 states have internal predecessors, (320), 33 states have call successors, (33), 26 states have call predecessors, (33), 26 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-17 15:30:04,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 386 transitions. [2025-03-17 15:30:04,173 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 386 transitions. Word has length 58 [2025-03-17 15:30:04,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:04,174 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 386 transitions. [2025-03-17 15:30:04,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.238095238095238) internal successors, (68), 21 states have internal predecessors, (68), 9 states have call successors, (21), 5 states have call predecessors, (21), 5 states have return successors, (21), 9 states have call predecessors, (21), 9 states have call successors, (21) [2025-03-17 15:30:04,174 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 386 transitions. [2025-03-17 15:30:04,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 15:30:04,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:04,175 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2025-03-17 15:30:04,182 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:30:04,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:04,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:04,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:04,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1644021696, now seen corresponding path program 1 times [2025-03-17 15:30:04,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:04,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568479254] [2025-03-17 15:30:04,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:04,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:04,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 15:30:04,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:30:04,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:04,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 15:30:04,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:04,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568479254] [2025-03-17 15:30:04,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568479254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:04,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916466675] [2025-03-17 15:30:04,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:04,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:04,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:04,542 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:30:04,544 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:30:04,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 15:30:04,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 15:30:04,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:04,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:04,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:30:04,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:04,729 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:04,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 15:30:04,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916466675] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:04,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 15:30:04,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2025-03-17 15:30:04,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062190321] [2025-03-17 15:30:04,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:04,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 15:30:04,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:04,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 15:30:04,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-17 15:30:04,731 INFO L87 Difference]: Start difference. First operand 322 states and 386 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 15:30:05,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:05,048 INFO L93 Difference]: Finished difference Result 390 states and 468 transitions. [2025-03-17 15:30:05,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 15:30:05,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 64 [2025-03-17 15:30:05,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:05,051 INFO L225 Difference]: With dead ends: 390 [2025-03-17 15:30:05,051 INFO L226 Difference]: Without dead ends: 387 [2025-03-17 15:30:05,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2025-03-17 15:30:05,053 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 73 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:05,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 190 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:30:05,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-03-17 15:30:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 292. [2025-03-17 15:30:05,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 233 states have (on average 1.1630901287553648) internal successors, (271), 236 states have internal predecessors, (271), 31 states have call successors, (31), 25 states have call predecessors, (31), 25 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-17 15:30:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 333 transitions. [2025-03-17 15:30:05,074 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 333 transitions. Word has length 64 [2025-03-17 15:30:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:05,074 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 333 transitions. [2025-03-17 15:30:05,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 11 states have internal predecessors, (39), 5 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2025-03-17 15:30:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 333 transitions. [2025-03-17 15:30:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-17 15:30:05,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:05,076 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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] [2025-03-17 15:30:05,085 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:30:05,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:05,276 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:05,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:05,277 INFO L85 PathProgramCache]: Analyzing trace with hash -574934972, now seen corresponding path program 1 times [2025-03-17 15:30:05,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:05,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42228353] [2025-03-17 15:30:05,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:05,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:30:05,286 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:30:05,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:05,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:05,427 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 15:30:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42228353] [2025-03-17 15:30:05,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42228353] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2122681410] [2025-03-17 15:30:05,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:05,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:05,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:05,429 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:30:05,432 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:30:05,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-17 15:30:05,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-17 15:30:05,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:05,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:05,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 15:30:05,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:05,613 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:05,613 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-03-17 15:30:05,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2122681410] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:05,787 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:05,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-03-17 15:30:05,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90341115] [2025-03-17 15:30:05,787 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:05,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-17 15:30:05,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:05,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-17 15:30:05,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-17 15:30:05,789 INFO L87 Difference]: Start difference. First operand 292 states and 333 transitions. Second operand has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 15:30:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:06,854 INFO L93 Difference]: Finished difference Result 331 states and 380 transitions. [2025-03-17 15:30:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-17 15:30:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) Word has length 65 [2025-03-17 15:30:06,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:06,857 INFO L225 Difference]: With dead ends: 331 [2025-03-17 15:30:06,857 INFO L226 Difference]: Without dead ends: 330 [2025-03-17 15:30:06,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 733 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=715, Invalid=2945, Unknown=0, NotChecked=0, Total=3660 [2025-03-17 15:30:06,859 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 219 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:06,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 273 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:30:06,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-17 15:30:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 305. [2025-03-17 15:30:06,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 244 states have (on average 1.1598360655737705) internal successors, (283), 247 states have internal predecessors, (283), 32 states have call successors, (32), 26 states have call predecessors, (32), 26 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 15:30:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 347 transitions. [2025-03-17 15:30:06,872 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 347 transitions. Word has length 65 [2025-03-17 15:30:06,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:06,872 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 347 transitions. [2025-03-17 15:30:06,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.966666666666667) internal successors, (89), 31 states have internal predecessors, (89), 14 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2025-03-17 15:30:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 347 transitions. [2025-03-17 15:30:06,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 15:30:06,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:06,873 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 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:30:06,881 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:30:07,074 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:30:07,074 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:07,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:07,074 INFO L85 PathProgramCache]: Analyzing trace with hash 878798126, now seen corresponding path program 1 times [2025-03-17 15:30:07,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:07,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840343773] [2025-03-17 15:30:07,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:07,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:07,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 15:30:07,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 15:30:07,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:07,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:07,290 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 15:30:07,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:07,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840343773] [2025-03-17 15:30:07,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840343773] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:07,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136450910] [2025-03-17 15:30:07,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:07,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:07,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:07,292 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:30:07,294 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:30:07,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 15:30:07,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 15:30:07,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:07,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:07,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 15:30:07,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:07,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:07,667 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 15:30:07,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136450910] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:07,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:07,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 29 [2025-03-17 15:30:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035531477] [2025-03-17 15:30:07,668 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:07,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 15:30:07,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:07,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 15:30:07,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2025-03-17 15:30:07,670 INFO L87 Difference]: Start difference. First operand 305 states and 347 transitions. Second operand has 29 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 29 states have internal predecessors, (95), 13 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) [2025-03-17 15:30:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:08,339 INFO L93 Difference]: Finished difference Result 541 states and 627 transitions. [2025-03-17 15:30:08,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-17 15:30:08,340 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 29 states have internal predecessors, (95), 13 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) Word has length 79 [2025-03-17 15:30:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:08,342 INFO L225 Difference]: With dead ends: 541 [2025-03-17 15:30:08,342 INFO L226 Difference]: Without dead ends: 382 [2025-03-17 15:30:08,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=643, Invalid=1709, Unknown=0, NotChecked=0, Total=2352 [2025-03-17 15:30:08,343 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 126 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:08,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 386 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 15:30:08,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2025-03-17 15:30:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 359. [2025-03-17 15:30:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 288 states have (on average 1.1527777777777777) internal successors, (332), 291 states have internal predecessors, (332), 37 states have call successors, (37), 31 states have call predecessors, (37), 31 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-17 15:30:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 406 transitions. [2025-03-17 15:30:08,365 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 406 transitions. Word has length 79 [2025-03-17 15:30:08,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:08,365 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 406 transitions. [2025-03-17 15:30:08,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.2758620689655173) internal successors, (95), 29 states have internal predecessors, (95), 13 states have call successors, (27), 7 states have call predecessors, (27), 7 states have return successors, (27), 13 states have call predecessors, (27), 13 states have call successors, (27) [2025-03-17 15:30:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 406 transitions. [2025-03-17 15:30:08,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:30:08,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:08,378 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:08,385 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:30:08,578 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:30:08,579 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:08,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:08,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1575096724, now seen corresponding path program 1 times [2025-03-17 15:30:08,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:08,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668030435] [2025-03-17 15:30:08,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:08,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:08,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:30:08,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:30:08,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:08,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:08,790 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:30:08,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:08,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668030435] [2025-03-17 15:30:08,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668030435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:08,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [582594270] [2025-03-17 15:30:08,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:08,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:08,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:08,792 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:30:08,794 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:30:08,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:30:08,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:30:08,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:08,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:08,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:30:08,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:09,029 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:30:09,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [582594270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:09,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:09,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-17 15:30:09,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357700786] [2025-03-17 15:30:09,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:09,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 15:30:09,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:09,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 15:30:09,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 15:30:09,287 INFO L87 Difference]: Start difference. First operand 359 states and 406 transitions. Second operand has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-17 15:30:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:10,801 INFO L93 Difference]: Finished difference Result 775 states and 905 transitions. [2025-03-17 15:30:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-17 15:30:10,802 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 85 [2025-03-17 15:30:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:10,804 INFO L225 Difference]: With dead ends: 775 [2025-03-17 15:30:10,804 INFO L226 Difference]: Without dead ends: 616 [2025-03-17 15:30:10,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1770, Invalid=7350, Unknown=0, NotChecked=0, Total=9120 [2025-03-17 15:30:10,809 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 395 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:10,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 394 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 15:30:10,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2025-03-17 15:30:10,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 555. [2025-03-17 15:30:10,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 444 states have (on average 1.1756756756756757) internal successors, (522), 447 states have internal predecessors, (522), 57 states have call successors, (57), 51 states have call predecessors, (57), 51 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-17 15:30:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 636 transitions. [2025-03-17 15:30:10,835 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 636 transitions. Word has length 85 [2025-03-17 15:30:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:10,835 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 636 transitions. [2025-03-17 15:30:10,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-17 15:30:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 636 transitions. [2025-03-17 15:30:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-17 15:30:10,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:10,837 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 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] [2025-03-17 15:30:10,843 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:30:11,041 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:30:11,041 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:11,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1505985093, now seen corresponding path program 1 times [2025-03-17 15:30:11,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:11,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800465051] [2025-03-17 15:30:11,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:11,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:11,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:30:11,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:30:11,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:11,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:30:11,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800465051] [2025-03-17 15:30:11,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800465051] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:11,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581866795] [2025-03-17 15:30:11,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:11,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:11,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:11,265 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:30:11,266 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:30:11,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-17 15:30:11,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-17 15:30:11,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:11,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:11,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 15:30:11,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:11,512 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 96 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:11,512 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:11,758 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-17 15:30:11,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581866795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:11,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:11,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-17 15:30:11,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24601178] [2025-03-17 15:30:11,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:11,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-17 15:30:11,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:11,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-17 15:30:11,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2025-03-17 15:30:11,760 INFO L87 Difference]: Start difference. First operand 555 states and 636 transitions. Second operand has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-17 15:30:13,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:13,128 INFO L93 Difference]: Finished difference Result 715 states and 821 transitions. [2025-03-17 15:30:13,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-17 15:30:13,129 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) Word has length 85 [2025-03-17 15:30:13,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:13,131 INFO L225 Difference]: With dead ends: 715 [2025-03-17 15:30:13,131 INFO L226 Difference]: Without dead ends: 712 [2025-03-17 15:30:13,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1656, Invalid=6716, Unknown=0, NotChecked=0, Total=8372 [2025-03-17 15:30:13,133 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 301 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:13,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 418 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 15:30:13,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-17 15:30:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 607. [2025-03-17 15:30:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 607 states, 484 states have (on average 1.1818181818181819) internal successors, (572), 487 states have internal predecessors, (572), 63 states have call successors, (63), 57 states have call predecessors, (63), 57 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-17 15:30:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 698 transitions. [2025-03-17 15:30:13,160 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 698 transitions. Word has length 85 [2025-03-17 15:30:13,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:13,160 INFO L471 AbstractCegarLoop]: Abstraction has 607 states and 698 transitions. [2025-03-17 15:30:13,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.9761904761904763) internal successors, (125), 43 states have internal predecessors, (125), 20 states have call successors, (26), 7 states have call predecessors, (26), 7 states have return successors, (26), 20 states have call predecessors, (26), 20 states have call successors, (26) [2025-03-17 15:30:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 698 transitions. [2025-03-17 15:30:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 15:30:13,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:13,161 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:13,170 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:30:13,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-17 15:30:13,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:13,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 35941910, now seen corresponding path program 1 times [2025-03-17 15:30:13,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:13,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647173020] [2025-03-17 15:30:13,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:13,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:13,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 15:30:13,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 15:30:13,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:13,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:13,594 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-17 15:30:13,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647173020] [2025-03-17 15:30:13,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647173020] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124283638] [2025-03-17 15:30:13,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:13,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:13,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:13,597 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:30:13,598 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:30:13,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 15:30:13,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 15:30:13,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:13,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:13,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 15:30:13,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 142 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:13,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:14,042 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 3 proven. 58 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-17 15:30:14,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124283638] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:14,042 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:14,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 37 [2025-03-17 15:30:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635061609] [2025-03-17 15:30:14,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:14,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-17 15:30:14,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:14,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 15:30:14,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 15:30:14,044 INFO L87 Difference]: Start difference. First operand 607 states and 698 transitions. Second operand has 37 states, 37 states have (on average 3.27027027027027) internal successors, (121), 37 states have internal predecessors, (121), 17 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2025-03-17 15:30:15,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:15,053 INFO L93 Difference]: Finished difference Result 1130 states and 1313 transitions. [2025-03-17 15:30:15,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-17 15:30:15,054 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.27027027027027) internal successors, (121), 37 states have internal predecessors, (121), 17 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) Word has length 99 [2025-03-17 15:30:15,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:15,057 INFO L225 Difference]: With dead ends: 1130 [2025-03-17 15:30:15,057 INFO L226 Difference]: Without dead ends: 841 [2025-03-17 15:30:15,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1135, Invalid=4415, Unknown=0, NotChecked=0, Total=5550 [2025-03-17 15:30:15,061 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 226 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:15,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 477 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 15:30:15,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-17 15:30:15,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 757. [2025-03-17 15:30:15,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 757 states, 604 states have (on average 1.1589403973509933) internal successors, (700), 607 states have internal predecessors, (700), 78 states have call successors, (78), 72 states have call predecessors, (78), 72 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 15:30:15,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 856 transitions. [2025-03-17 15:30:15,096 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 856 transitions. Word has length 99 [2025-03-17 15:30:15,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:15,096 INFO L471 AbstractCegarLoop]: Abstraction has 757 states and 856 transitions. [2025-03-17 15:30:15,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.27027027027027) internal successors, (121), 37 states have internal predecessors, (121), 17 states have call successors, (33), 9 states have call predecessors, (33), 9 states have return successors, (33), 17 states have call predecessors, (33), 17 states have call successors, (33) [2025-03-17 15:30:15,096 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 856 transitions. [2025-03-17 15:30:15,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 15:30:15,097 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:15,097 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:15,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:15,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 15:30:15,298 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:15,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1254571050, now seen corresponding path program 1 times [2025-03-17 15:30:15,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:15,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752582552] [2025-03-17 15:30:15,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:15,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:15,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 15:30:15,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 15:30:15,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:15,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:15,544 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 15:30:15,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:15,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752582552] [2025-03-17 15:30:15,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752582552] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:15,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1243950859] [2025-03-17 15:30:15,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:15,544 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:15,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:15,546 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:30:15,547 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:30:15,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 15:30:15,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 15:30:15,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:15,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:15,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 15:30:15,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:15,860 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 3 proven. 166 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:15,860 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:16,195 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 3 proven. 54 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-17 15:30:16,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1243950859] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:16,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:16,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2025-03-17 15:30:16,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393192105] [2025-03-17 15:30:16,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:16,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-17 15:30:16,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:16,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-17 15:30:16,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=2406, Unknown=0, NotChecked=0, Total=2970 [2025-03-17 15:30:16,197 INFO L87 Difference]: Start difference. First operand 757 states and 856 transitions. Second operand has 55 states, 54 states have (on average 2.9814814814814814) internal successors, (161), 55 states have internal predecessors, (161), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-17 15:30:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:18,189 INFO L93 Difference]: Finished difference Result 926 states and 1051 transitions. [2025-03-17 15:30:18,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-17 15:30:18,189 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 2.9814814814814814) internal successors, (161), 55 states have internal predecessors, (161), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) Word has length 105 [2025-03-17 15:30:18,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:18,193 INFO L225 Difference]: With dead ends: 926 [2025-03-17 15:30:18,193 INFO L226 Difference]: Without dead ends: 924 [2025-03-17 15:30:18,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3588 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2754, Invalid=12008, Unknown=0, NotChecked=0, Total=14762 [2025-03-17 15:30:18,198 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 497 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:18,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 426 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 15:30:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2025-03-17 15:30:18,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 623. [2025-03-17 15:30:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 496 states have (on average 1.1612903225806452) internal successors, (576), 500 states have internal predecessors, (576), 65 states have call successors, (65), 59 states have call predecessors, (65), 59 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 15:30:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 706 transitions. [2025-03-17 15:30:18,239 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 706 transitions. Word has length 105 [2025-03-17 15:30:18,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:18,239 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 706 transitions. [2025-03-17 15:30:18,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 2.9814814814814814) internal successors, (161), 55 states have internal predecessors, (161), 26 states have call successors, (32), 9 states have call predecessors, (32), 9 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2025-03-17 15:30:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 706 transitions. [2025-03-17 15:30:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-17 15:30:18,241 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:18,242 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 7, 7, 7, 7, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:18,248 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:30:18,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 15:30:18,442 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:18,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:18,443 INFO L85 PathProgramCache]: Analyzing trace with hash -249620956, now seen corresponding path program 2 times [2025-03-17 15:30:18,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600388560] [2025-03-17 15:30:18,443 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:18,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 145 statements into 2 equivalence classes. [2025-03-17 15:30:18,462 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 145 of 145 statements. [2025-03-17 15:30:18,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:18,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:18,617 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2025-03-17 15:30:18,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:18,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600388560] [2025-03-17 15:30:18,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600388560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:18,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:18,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:30:18,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054313265] [2025-03-17 15:30:18,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:18,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:30:18,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:18,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:30:18,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:30:18,618 INFO L87 Difference]: Start difference. First operand 623 states and 706 transitions. Second operand has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:30:18,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:18,715 INFO L93 Difference]: Finished difference Result 637 states and 720 transitions. [2025-03-17 15:30:18,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:30:18,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 145 [2025-03-17 15:30:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:18,718 INFO L225 Difference]: With dead ends: 637 [2025-03-17 15:30:18,718 INFO L226 Difference]: Without dead ends: 636 [2025-03-17 15:30:18,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 15:30:18,719 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 23 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 131 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.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:18,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 131 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:18,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-17 15:30:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 623. [2025-03-17 15:30:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 496 states have (on average 1.159274193548387) internal successors, (575), 500 states have internal predecessors, (575), 65 states have call successors, (65), 59 states have call predecessors, (65), 59 states have return successors, (65), 63 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-17 15:30:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 705 transitions. [2025-03-17 15:30:18,750 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 705 transitions. Word has length 145 [2025-03-17 15:30:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:18,751 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 705 transitions. [2025-03-17 15:30:18,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.5) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:30:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 705 transitions. [2025-03-17 15:30:18,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-17 15:30:18,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:18,755 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:18,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 15:30:18,755 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:18,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:18,756 INFO L85 PathProgramCache]: Analyzing trace with hash -2120878305, now seen corresponding path program 2 times [2025-03-17 15:30:18,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:18,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395033878] [2025-03-17 15:30:18,756 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:18,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:18,765 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-03-17 15:30:18,789 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 15:30:18,789 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:18,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:19,276 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 15:30:19,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395033878] [2025-03-17 15:30:19,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395033878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:19,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953981298] [2025-03-17 15:30:19,276 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:19,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:19,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:19,278 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:30:19,281 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:30:19,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 149 statements into 2 equivalence classes. [2025-03-17 15:30:19,344 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 15:30:19,344 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:19,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:19,346 INFO L256 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 15:30:19,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:19,528 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 3 proven. 442 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:19,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 3 proven. 178 refuted. 0 times theorem prover too weak. 288 trivial. 0 not checked. [2025-03-17 15:30:20,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953981298] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:20,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:20,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 57 [2025-03-17 15:30:20,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575748509] [2025-03-17 15:30:20,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:20,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-17 15:30:20,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:20,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-17 15:30:20,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=2563, Unknown=0, NotChecked=0, Total=3192 [2025-03-17 15:30:20,029 INFO L87 Difference]: Start difference. First operand 623 states and 705 transitions. Second operand has 57 states, 57 states have (on average 3.263157894736842) internal successors, (186), 57 states have internal predecessors, (186), 27 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 27 states have call predecessors, (48), 27 states have call successors, (48) [2025-03-17 15:30:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:21,932 INFO L93 Difference]: Finished difference Result 1488 states and 1717 transitions. [2025-03-17 15:30:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-03-17 15:30:21,932 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.263157894736842) internal successors, (186), 57 states have internal predecessors, (186), 27 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 27 states have call predecessors, (48), 27 states have call successors, (48) Word has length 149 [2025-03-17 15:30:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:21,938 INFO L225 Difference]: With dead ends: 1488 [2025-03-17 15:30:21,938 INFO L226 Difference]: Without dead ends: 1223 [2025-03-17 15:30:21,940 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 270 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4273 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3050, Invalid=12450, Unknown=0, NotChecked=0, Total=15500 [2025-03-17 15:30:21,941 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 446 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:21,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 535 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 15:30:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2025-03-17 15:30:21,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 897. [2025-03-17 15:30:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 897 states, 716 states have (on average 1.1480446927374302) internal successors, (822), 720 states have internal predecessors, (822), 92 states have call successors, (92), 86 states have call predecessors, (92), 86 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-03-17 15:30:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 897 states to 897 states and 1006 transitions. [2025-03-17 15:30:21,988 INFO L78 Accepts]: Start accepts. Automaton has 897 states and 1006 transitions. Word has length 149 [2025-03-17 15:30:21,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:21,989 INFO L471 AbstractCegarLoop]: Abstraction has 897 states and 1006 transitions. [2025-03-17 15:30:21,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.263157894736842) internal successors, (186), 57 states have internal predecessors, (186), 27 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 27 states have call predecessors, (48), 27 states have call successors, (48) [2025-03-17 15:30:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 897 states and 1006 transitions. [2025-03-17 15:30:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-03-17 15:30:21,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:21,991 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 10, 10, 9, 9, 9, 9, 8, 4, 4, 4, 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:30:21,999 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:30:22,192 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:30:22,192 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:22,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:22,193 INFO L85 PathProgramCache]: Analyzing trace with hash 981759759, now seen corresponding path program 1 times [2025-03-17 15:30:22,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:22,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003637147] [2025-03-17 15:30:22,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:22,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:22,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 15:30:22,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 15:30:22,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:22,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 15:30:22,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003637147] [2025-03-17 15:30:22,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003637147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:22,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68137798] [2025-03-17 15:30:22,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:22,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:22,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:22,799 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:30:22,801 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:30:22,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-03-17 15:30:22,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-03-17 15:30:22,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:22,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:22,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 15:30:22,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:23,566 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 3 proven. 564 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:23,566 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 591 backedges. 3 proven. 252 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2025-03-17 15:30:24,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68137798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:24,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:24,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 84 [2025-03-17 15:30:24,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232051228] [2025-03-17 15:30:24,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:24,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2025-03-17 15:30:24,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:24,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2025-03-17 15:30:24,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1477, Invalid=5663, Unknown=0, NotChecked=0, Total=7140 [2025-03-17 15:30:24,457 INFO L87 Difference]: Start difference. First operand 897 states and 1006 transitions. Second operand has 85 states, 84 states have (on average 2.988095238095238) internal successors, (251), 85 states have internal predecessors, (251), 41 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 41 states have call predecessors, (47), 41 states have call successors, (47) [2025-03-17 15:30:28,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:28,096 INFO L93 Difference]: Finished difference Result 1924 states and 2208 transitions. [2025-03-17 15:30:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2025-03-17 15:30:28,097 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 2.988095238095238) internal successors, (251), 85 states have internal predecessors, (251), 41 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 41 states have call predecessors, (47), 41 states have call successors, (47) Word has length 155 [2025-03-17 15:30:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:28,102 INFO L225 Difference]: With dead ends: 1924 [2025-03-17 15:30:28,102 INFO L226 Difference]: Without dead ends: 1659 [2025-03-17 15:30:28,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8378 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=7279, Invalid=27131, Unknown=0, NotChecked=0, Total=34410 [2025-03-17 15:30:28,105 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 845 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:28,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 636 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 15:30:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-03-17 15:30:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1180. [2025-03-17 15:30:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 943 states have (on average 1.159066808059385) internal successors, (1093), 947 states have internal predecessors, (1093), 120 states have call successors, (120), 114 states have call predecessors, (120), 114 states have return successors, (120), 118 states have call predecessors, (120), 120 states have call successors, (120) [2025-03-17 15:30:28,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1333 transitions. [2025-03-17 15:30:28,161 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1333 transitions. Word has length 155 [2025-03-17 15:30:28,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:28,162 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1333 transitions. [2025-03-17 15:30:28,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 2.988095238095238) internal successors, (251), 85 states have internal predecessors, (251), 41 states have call successors, (47), 14 states have call predecessors, (47), 14 states have return successors, (47), 41 states have call predecessors, (47), 41 states have call successors, (47) [2025-03-17 15:30:28,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1333 transitions. [2025-03-17 15:30:28,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-03-17 15:30:28,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:28,166 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 7, 7, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:28,173 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-17 15:30:28,370 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:30:28,370 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:28,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:28,371 INFO L85 PathProgramCache]: Analyzing trace with hash -815072960, now seen corresponding path program 2 times [2025-03-17 15:30:28,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:28,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631333170] [2025-03-17 15:30:28,371 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:28,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:28,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 165 statements into 2 equivalence classes. [2025-03-17 15:30:28,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 15:30:28,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:28,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:28,454 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-17 15:30:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:28,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631333170] [2025-03-17 15:30:28,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631333170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:28,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:28,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:30:28,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99349338] [2025-03-17 15:30:28,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:28,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 15:30:28,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:28,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 15:30:28,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 15:30:28,457 INFO L87 Difference]: Start difference. First operand 1180 states and 1333 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:30:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:28,572 INFO L93 Difference]: Finished difference Result 1195 states and 1349 transitions. [2025-03-17 15:30:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 15:30:28,572 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 165 [2025-03-17 15:30:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:28,576 INFO L225 Difference]: With dead ends: 1195 [2025-03-17 15:30:28,576 INFO L226 Difference]: Without dead ends: 1194 [2025-03-17 15:30:28,576 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:30:28,577 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 22 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:28,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 126 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2025-03-17 15:30:28,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 1044. [2025-03-17 15:30:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 835 states have (on average 1.162874251497006) internal successors, (971), 839 states have internal predecessors, (971), 106 states have call successors, (106), 100 states have call predecessors, (106), 100 states have return successors, (106), 104 states have call predecessors, (106), 106 states have call successors, (106) [2025-03-17 15:30:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1183 transitions. [2025-03-17 15:30:28,627 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1183 transitions. Word has length 165 [2025-03-17 15:30:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:28,627 INFO L471 AbstractCegarLoop]: Abstraction has 1044 states and 1183 transitions. [2025-03-17 15:30:28,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:30:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1183 transitions. [2025-03-17 15:30:28,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 15:30:28,630 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:28,630 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 11, 11, 11, 10, 10, 10, 9, 4, 4, 4, 3, 3, 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] [2025-03-17 15:30:28,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 15:30:28,630 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:28,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:28,630 INFO L85 PathProgramCache]: Analyzing trace with hash 627402140, now seen corresponding path program 1 times [2025-03-17 15:30:28,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:28,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476767878] [2025-03-17 15:30:28,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:28,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:28,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 15:30:28,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 15:30:28,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:28,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:28,693 INFO L134 CoverageAnalysis]: Checked inductivity of 716 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2025-03-17 15:30:28,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:28,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476767878] [2025-03-17 15:30:28,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476767878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:28,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:28,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:30:28,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845920603] [2025-03-17 15:30:28,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:28,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:28,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:28,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:28,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:30:28,695 INFO L87 Difference]: Start difference. First operand 1044 states and 1183 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 15:30:28,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:28,749 INFO L93 Difference]: Finished difference Result 1479 states and 1700 transitions. [2025-03-17 15:30:28,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:28,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 169 [2025-03-17 15:30:28,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:28,753 INFO L225 Difference]: With dead ends: 1479 [2025-03-17 15:30:28,753 INFO L226 Difference]: Without dead ends: 1063 [2025-03-17 15:30:28,754 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:30:28,754 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:28,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 154 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 15:30:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-03-17 15:30:28,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1057. [2025-03-17 15:30:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1057 states, 846 states have (on average 1.160756501182033) internal successors, (982), 851 states have internal predecessors, (982), 109 states have call successors, (109), 99 states have call predecessors, (109), 99 states have return successors, (109), 106 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-17 15:30:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1200 transitions. [2025-03-17 15:30:28,809 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1200 transitions. Word has length 169 [2025-03-17 15:30:28,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:28,811 INFO L471 AbstractCegarLoop]: Abstraction has 1057 states and 1200 transitions. [2025-03-17 15:30:28,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 15:30:28,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1200 transitions. [2025-03-17 15:30:28,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-17 15:30:28,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:28,813 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 8, 8, 8, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:28,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 15:30:28,814 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:28,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:28,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1923691745, now seen corresponding path program 1 times [2025-03-17 15:30:28,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:28,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032195647] [2025-03-17 15:30:28,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:28,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:28,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 15:30:28,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 15:30:28,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:28,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 6 proven. 220 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-17 15:30:29,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:29,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032195647] [2025-03-17 15:30:29,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032195647] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:29,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799058961] [2025-03-17 15:30:29,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:29,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:29,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:29,378 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:29,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-17 15:30:29,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-17 15:30:29,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-17 15:30:29,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:29,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 15:30:29,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:29,592 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 6 proven. 584 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:29,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:30,182 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 6 proven. 220 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2025-03-17 15:30:30,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799058961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:30,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:30,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 32] total 65 [2025-03-17 15:30:30,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274781440] [2025-03-17 15:30:30,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:30,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-17 15:30:30,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:30,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-17 15:30:30,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=3359, Unknown=0, NotChecked=0, Total=4160 [2025-03-17 15:30:30,184 INFO L87 Difference]: Start difference. First operand 1057 states and 1200 transitions. Second operand has 65 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 65 states have internal predecessors, (212), 31 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 31 states have call predecessors, (54), 31 states have call successors, (54) [2025-03-17 15:30:32,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:32,392 INFO L93 Difference]: Finished difference Result 2485 states and 2816 transitions. [2025-03-17 15:30:32,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-17 15:30:32,393 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 65 states have internal predecessors, (212), 31 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 31 states have call predecessors, (54), 31 states have call successors, (54) Word has length 169 [2025-03-17 15:30:32,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:32,405 INFO L225 Difference]: With dead ends: 2485 [2025-03-17 15:30:32,405 INFO L226 Difference]: Without dead ends: 2090 [2025-03-17 15:30:32,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5654 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3773, Invalid=15967, Unknown=0, NotChecked=0, Total=19740 [2025-03-17 15:30:32,408 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 499 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 499 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:32,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [499 Valid, 458 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-17 15:30:32,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2090 states. [2025-03-17 15:30:32,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2090 to 1437. [2025-03-17 15:30:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1150 states have (on average 1.1443478260869566) internal successors, (1316), 1155 states have internal predecessors, (1316), 147 states have call successors, (147), 137 states have call predecessors, (147), 137 states have return successors, (147), 144 states have call predecessors, (147), 147 states have call successors, (147) [2025-03-17 15:30:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1610 transitions. [2025-03-17 15:30:32,486 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1610 transitions. Word has length 169 [2025-03-17 15:30:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:32,486 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 1610 transitions. [2025-03-17 15:30:32,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.2615384615384615) internal successors, (212), 65 states have internal predecessors, (212), 31 states have call successors, (54), 16 states have call predecessors, (54), 16 states have return successors, (54), 31 states have call predecessors, (54), 31 states have call successors, (54) [2025-03-17 15:30:32,487 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1610 transitions. [2025-03-17 15:30:32,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-17 15:30:32,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:32,489 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 10, 10, 10, 9, 9, 9, 8, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:30:32,496 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 15:30:32,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-17 15:30:32,694 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:32,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:32,694 INFO L85 PathProgramCache]: Analyzing trace with hash -11410786, now seen corresponding path program 1 times [2025-03-17 15:30:32,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:32,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427899202] [2025-03-17 15:30:32,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:32,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:32,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 15:30:32,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 15:30:32,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:32,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:32,769 INFO L134 CoverageAnalysis]: Checked inductivity of 682 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 562 trivial. 0 not checked. [2025-03-17 15:30:32,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:32,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427899202] [2025-03-17 15:30:32,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427899202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:32,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:32,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 15:30:32,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612637892] [2025-03-17 15:30:32,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:32,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 15:30:32,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:32,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 15:30:32,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 15:30:32,772 INFO L87 Difference]: Start difference. First operand 1437 states and 1610 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 15:30:32,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:32,917 INFO L93 Difference]: Finished difference Result 2332 states and 2642 transitions. [2025-03-17 15:30:32,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 15:30:32,918 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 173 [2025-03-17 15:30:32,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:32,925 INFO L225 Difference]: With dead ends: 2332 [2025-03-17 15:30:32,925 INFO L226 Difference]: Without dead ends: 1489 [2025-03-17 15:30:32,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:30:32,928 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 13 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:32,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 148 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:32,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1489 states. [2025-03-17 15:30:33,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1489 to 1469. [2025-03-17 15:30:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 1177 states have (on average 1.139337298215803) internal successors, (1341), 1183 states have internal predecessors, (1341), 152 states have call successors, (152), 137 states have call predecessors, (152), 137 states have return successors, (152), 148 states have call predecessors, (152), 152 states have call successors, (152) [2025-03-17 15:30:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1645 transitions. [2025-03-17 15:30:33,030 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1645 transitions. Word has length 173 [2025-03-17 15:30:33,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:33,030 INFO L471 AbstractCegarLoop]: Abstraction has 1469 states and 1645 transitions. [2025-03-17 15:30:33,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-17 15:30:33,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1645 transitions. [2025-03-17 15:30:33,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2025-03-17 15:30:33,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:33,033 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 6, 6, 6, 6, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:33,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 15:30:33,033 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:33,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:33,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1577678768, now seen corresponding path program 3 times [2025-03-17 15:30:33,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:33,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144453869] [2025-03-17 15:30:33,033 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:30:33,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:33,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 179 statements into 13 equivalence classes. [2025-03-17 15:30:33,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 44 of 179 statements. [2025-03-17 15:30:33,049 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 15:30:33,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:33,114 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2025-03-17 15:30:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144453869] [2025-03-17 15:30:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144453869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:30:33,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:30:33,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:30:33,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8936029] [2025-03-17 15:30:33,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:30:33,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:30:33,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:33,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:30:33,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:30:33,116 INFO L87 Difference]: Start difference. First operand 1469 states and 1645 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:30:33,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:33,291 INFO L93 Difference]: Finished difference Result 1474 states and 1649 transitions. [2025-03-17 15:30:33,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:30:33,294 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 179 [2025-03-17 15:30:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:33,300 INFO L225 Difference]: With dead ends: 1474 [2025-03-17 15:30:33,300 INFO L226 Difference]: Without dead ends: 1473 [2025-03-17 15:30:33,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:30:33,301 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 25 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:33,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 176 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:30:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2025-03-17 15:30:33,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1214. [2025-03-17 15:30:33,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 971 states have (on average 1.129763130792997) internal successors, (1097), 977 states have internal predecessors, (1097), 126 states have call successors, (126), 114 states have call predecessors, (126), 114 states have return successors, (126), 122 states have call predecessors, (126), 126 states have call successors, (126) [2025-03-17 15:30:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1349 transitions. [2025-03-17 15:30:33,376 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1349 transitions. Word has length 179 [2025-03-17 15:30:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:33,376 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1349 transitions. [2025-03-17 15:30:33,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:30:33,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1349 transitions. [2025-03-17 15:30:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-03-17 15:30:33,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:33,379 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 17, 13, 13, 13, 12, 12, 12, 11, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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:30:33,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 15:30:33,379 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:33,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:33,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1343823294, now seen corresponding path program 1 times [2025-03-17 15:30:33,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:33,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065357026] [2025-03-17 15:30:33,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:33,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 15:30:33,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 15:30:33,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:33,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 9 proven. 468 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-17 15:30:34,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:34,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065357026] [2025-03-17 15:30:34,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065357026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:34,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176779497] [2025-03-17 15:30:34,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:34,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:34,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:34,040 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:34,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-17 15:30:34,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-17 15:30:34,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-17 15:30:34,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:34,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:34,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 15:30:34,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:34,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 9 proven. 1012 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:34,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:35,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1045 backedges. 9 proven. 468 refuted. 0 times theorem prover too weak. 568 trivial. 0 not checked. [2025-03-17 15:30:35,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176779497] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:35,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:35,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37, 38] total 77 [2025-03-17 15:30:35,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634198886] [2025-03-17 15:30:35,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:35,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-03-17 15:30:35,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:35,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-03-17 15:30:35,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1207, Invalid=4645, Unknown=0, NotChecked=0, Total=5852 [2025-03-17 15:30:35,052 INFO L87 Difference]: Start difference. First operand 1214 states and 1349 transitions. Second operand has 77 states, 77 states have (on average 3.25974025974026) internal successors, (251), 77 states have internal predecessors, (251), 37 states have call successors, (63), 19 states have call predecessors, (63), 19 states have return successors, (63), 37 states have call predecessors, (63), 37 states have call successors, (63) [2025-03-17 15:30:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:37,736 INFO L93 Difference]: Finished difference Result 2634 states and 2959 transitions. [2025-03-17 15:30:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2025-03-17 15:30:37,737 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.25974025974026) internal successors, (251), 77 states have internal predecessors, (251), 37 states have call successors, (63), 19 states have call predecessors, (63), 19 states have return successors, (63), 37 states have call predecessors, (63), 37 states have call successors, (63) Word has length 199 [2025-03-17 15:30:37,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:37,744 INFO L225 Difference]: With dead ends: 2634 [2025-03-17 15:30:37,744 INFO L226 Difference]: Without dead ends: 2320 [2025-03-17 15:30:37,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 360 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7243 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=5582, Invalid=20824, Unknown=0, NotChecked=0, Total=26406 [2025-03-17 15:30:37,747 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 730 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:37,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 532 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 15:30:37,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2320 states. [2025-03-17 15:30:37,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2320 to 2110. [2025-03-17 15:30:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 1690 states have (on average 1.1171597633136094) internal successors, (1888), 1696 states have internal predecessors, (1888), 214 states have call successors, (214), 203 states have call predecessors, (214), 203 states have return successors, (214), 210 states have call predecessors, (214), 214 states have call successors, (214) [2025-03-17 15:30:37,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 2316 transitions. [2025-03-17 15:30:37,892 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 2316 transitions. Word has length 199 [2025-03-17 15:30:37,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:37,893 INFO L471 AbstractCegarLoop]: Abstraction has 2110 states and 2316 transitions. [2025-03-17 15:30:37,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.25974025974026) internal successors, (251), 77 states have internal predecessors, (251), 37 states have call successors, (63), 19 states have call predecessors, (63), 19 states have return successors, (63), 37 states have call predecessors, (63), 37 states have call successors, (63) [2025-03-17 15:30:37,894 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 2316 transitions. [2025-03-17 15:30:37,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-03-17 15:30:37,898 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:37,898 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 14, 14, 14, 14, 14, 14, 12, 4, 4, 4, 3, 3, 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] [2025-03-17 15:30:37,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 15:30:38,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:38,099 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:38,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:38,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1803115245, now seen corresponding path program 1 times [2025-03-17 15:30:38,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:38,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714637064] [2025-03-17 15:30:38,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:38,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:38,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 15:30:38,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 15:30:38,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:38,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:38,895 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 564 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-03-17 15:30:38,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714637064] [2025-03-17 15:30:38,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714637064] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:38,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582941027] [2025-03-17 15:30:38,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 15:30:38,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:38,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:38,897 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:38,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-17 15:30:38,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-17 15:30:38,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-17 15:30:38,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 15:30:38,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:38,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 15:30:38,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:39,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 1173 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:39,876 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 3 proven. 561 refuted. 0 times theorem prover too weak. 636 trivial. 0 not checked. [2025-03-17 15:30:41,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582941027] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:41,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:41,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 38] total 114 [2025-03-17 15:30:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860680858] [2025-03-17 15:30:41,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:41,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2025-03-17 15:30:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:41,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2025-03-17 15:30:41,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2714, Invalid=10396, Unknown=0, NotChecked=0, Total=13110 [2025-03-17 15:30:41,245 INFO L87 Difference]: Start difference. First operand 2110 states and 2316 transitions. Second operand has 115 states, 114 states have (on average 2.991228070175439) internal successors, (341), 115 states have internal predecessors, (341), 56 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2025-03-17 15:30:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:47,713 INFO L93 Difference]: Finished difference Result 4044 states and 4547 transitions. [2025-03-17 15:30:47,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2025-03-17 15:30:47,714 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 114 states have (on average 2.991228070175439) internal successors, (341), 115 states have internal predecessors, (341), 56 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) Word has length 205 [2025-03-17 15:30:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:47,728 INFO L225 Difference]: With dead ends: 4044 [2025-03-17 15:30:47,728 INFO L226 Difference]: Without dead ends: 3730 [2025-03-17 15:30:47,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 603 GetRequests, 335 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19108 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=14924, Invalid=57706, Unknown=0, NotChecked=0, Total=72630 [2025-03-17 15:30:47,733 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 1279 mSDsluCounter, 726 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 1181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:47,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 755 Invalid, 1181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-17 15:30:47,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3730 states. [2025-03-17 15:30:47,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3730 to 2382. [2025-03-17 15:30:47,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2382 states, 1908 states have (on average 1.121069182389937) internal successors, (2139), 1915 states have internal predecessors, (2139), 241 states have call successors, (241), 230 states have call predecessors, (241), 230 states have return successors, (241), 236 states have call predecessors, (241), 241 states have call successors, (241) [2025-03-17 15:30:47,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2382 states to 2382 states and 2621 transitions. [2025-03-17 15:30:47,924 INFO L78 Accepts]: Start accepts. Automaton has 2382 states and 2621 transitions. Word has length 205 [2025-03-17 15:30:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:47,924 INFO L471 AbstractCegarLoop]: Abstraction has 2382 states and 2621 transitions. [2025-03-17 15:30:47,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 114 states have (on average 2.991228070175439) internal successors, (341), 115 states have internal predecessors, (341), 56 states have call successors, (62), 19 states have call predecessors, (62), 19 states have return successors, (62), 56 states have call predecessors, (62), 56 states have call successors, (62) [2025-03-17 15:30:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 2382 states and 2621 transitions. [2025-03-17 15:30:47,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2025-03-17 15:30:47,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:47,929 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 18, 18, 18, 18, 18, 18, 16, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:30:47,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-17 15:30:48,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-17 15:30:48,130 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:48,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:48,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1670474662, now seen corresponding path program 2 times [2025-03-17 15:30:48,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:48,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934280235] [2025-03-17 15:30:48,130 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:48,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:48,140 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 259 statements into 2 equivalence classes. [2025-03-17 15:30:48,167 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 15:30:48,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:48,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 1996 backedges. 6 proven. 954 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-17 15:30:49,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:49,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934280235] [2025-03-17 15:30:49,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934280235] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:49,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823368105] [2025-03-17 15:30:49,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:49,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:49,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:49,359 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:49,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-17 15:30:49,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 259 statements into 2 equivalence classes. [2025-03-17 15:30:49,443 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 259 of 259 statements. [2025-03-17 15:30:49,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:49,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:49,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-17 15:30:49,449 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:49,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1996 backedges. 6 proven. 1966 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:49,672 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:51,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1996 backedges. 6 proven. 954 refuted. 0 times theorem prover too weak. 1036 trivial. 0 not checked. [2025-03-17 15:30:51,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823368105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:51,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:51,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 50] total 101 [2025-03-17 15:30:51,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150795034] [2025-03-17 15:30:51,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:51,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-03-17 15:30:51,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:51,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-03-17 15:30:51,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2095, Invalid=8005, Unknown=0, NotChecked=0, Total=10100 [2025-03-17 15:30:51,043 INFO L87 Difference]: Start difference. First operand 2382 states and 2621 transitions. Second operand has 101 states, 101 states have (on average 3.257425742574257) internal successors, (329), 101 states have internal predecessors, (329), 49 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 49 states have call predecessors, (81), 49 states have call successors, (81) [2025-03-17 15:30:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:30:55,627 INFO L93 Difference]: Finished difference Result 4220 states and 4721 transitions. [2025-03-17 15:30:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2025-03-17 15:30:55,628 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.257425742574257) internal successors, (329), 101 states have internal predecessors, (329), 49 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 49 states have call predecessors, (81), 49 states have call successors, (81) Word has length 259 [2025-03-17 15:30:55,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:30:55,638 INFO L225 Difference]: With dead ends: 4220 [2025-03-17 15:30:55,638 INFO L226 Difference]: Without dead ends: 3813 [2025-03-17 15:30:55,643 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 702 GetRequests, 468 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16390 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=11231, Invalid=44229, Unknown=0, NotChecked=0, Total=55460 [2025-03-17 15:30:55,644 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1036 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 15:30:55,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 734 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 15:30:55,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2025-03-17 15:30:55,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3114. [2025-03-17 15:30:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3114 states, 2492 states have (on average 1.1211878009630818) internal successors, (2794), 2499 states have internal predecessors, (2794), 315 states have call successors, (315), 304 states have call predecessors, (315), 304 states have return successors, (315), 310 states have call predecessors, (315), 315 states have call successors, (315) [2025-03-17 15:30:55,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3114 states to 3114 states and 3424 transitions. [2025-03-17 15:30:55,842 INFO L78 Accepts]: Start accepts. Automaton has 3114 states and 3424 transitions. Word has length 259 [2025-03-17 15:30:55,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:30:55,843 INFO L471 AbstractCegarLoop]: Abstraction has 3114 states and 3424 transitions. [2025-03-17 15:30:55,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.257425742574257) internal successors, (329), 101 states have internal predecessors, (329), 49 states have call successors, (81), 25 states have call predecessors, (81), 25 states have return successors, (81), 49 states have call predecessors, (81), 49 states have call successors, (81) [2025-03-17 15:30:55,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3114 states and 3424 transitions. [2025-03-17 15:30:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-03-17 15:30:55,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:30:55,848 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 20, 20, 20, 19, 19, 19, 18, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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:30:55,855 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-17 15:30:56,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 15:30:56,053 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:30:56,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:30:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1399267056, now seen corresponding path program 2 times [2025-03-17 15:30:56,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:30:56,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210344930] [2025-03-17 15:30:56,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:56,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:30:56,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 273 statements into 2 equivalence classes. [2025-03-17 15:30:56,097 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 15:30:56,097 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:56,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:57,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2272 backedges. 18 proven. 1126 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 15:30:57,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:30:57,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210344930] [2025-03-17 15:30:57,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210344930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:30:57,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279456868] [2025-03-17 15:30:57,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 15:30:57,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:30:57,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:30:57,252 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:30:57,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-17 15:30:57,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 273 statements into 2 equivalence classes. [2025-03-17 15:30:57,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 273 of 273 statements. [2025-03-17 15:30:57,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 15:30:57,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:30:57,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 587 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 15:30:57,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:30:57,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2272 backedges. 18 proven. 2230 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 15:30:57,559 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:30:58,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2272 backedges. 18 proven. 1126 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2025-03-17 15:30:58,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279456868] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:30:58,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:30:58,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 51, 52] total 105 [2025-03-17 15:30:58,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860896378] [2025-03-17 15:30:58,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:30:58,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2025-03-17 15:30:58,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:30:58,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2025-03-17 15:30:58,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2341, Invalid=8579, Unknown=0, NotChecked=0, Total=10920 [2025-03-17 15:30:58,997 INFO L87 Difference]: Start difference. First operand 3114 states and 3424 transitions. Second operand has 105 states, 105 states have (on average 3.295238095238095) internal successors, (346), 105 states have internal predecessors, (346), 51 states have call successors, (84), 26 states have call predecessors, (84), 26 states have return successors, (84), 51 states have call predecessors, (84), 51 states have call successors, (84) [2025-03-17 15:31:03,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:31:03,330 INFO L93 Difference]: Finished difference Result 5361 states and 5949 transitions. [2025-03-17 15:31:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2025-03-17 15:31:03,331 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 3.295238095238095) internal successors, (346), 105 states have internal predecessors, (346), 51 states have call successors, (84), 26 states have call predecessors, (84), 26 states have return successors, (84), 51 states have call predecessors, (84), 51 states have call successors, (84) Word has length 273 [2025-03-17 15:31:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:31:03,343 INFO L225 Difference]: With dead ends: 5361 [2025-03-17 15:31:03,343 INFO L226 Difference]: Without dead ends: 4954 [2025-03-17 15:31:03,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 719 GetRequests, 494 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14110 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=11487, Invalid=39815, Unknown=0, NotChecked=0, Total=51302 [2025-03-17 15:31:03,349 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1050 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-17 15:31:03,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 754 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 784 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-17 15:31:03,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4954 states. [2025-03-17 15:31:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4954 to 4547. [2025-03-17 15:31:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4547 states, 3641 states have (on average 1.1170008239494644) internal successors, (4067), 3647 states have internal predecessors, (4067), 457 states have call successors, (457), 446 states have call predecessors, (457), 446 states have return successors, (457), 453 states have call predecessors, (457), 457 states have call successors, (457) [2025-03-17 15:31:03,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4547 states to 4547 states and 4981 transitions. [2025-03-17 15:31:03,598 INFO L78 Accepts]: Start accepts. Automaton has 4547 states and 4981 transitions. Word has length 273 [2025-03-17 15:31:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:31:03,599 INFO L471 AbstractCegarLoop]: Abstraction has 4547 states and 4981 transitions. [2025-03-17 15:31:03,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 3.295238095238095) internal successors, (346), 105 states have internal predecessors, (346), 51 states have call successors, (84), 26 states have call predecessors, (84), 26 states have return successors, (84), 51 states have call predecessors, (84), 51 states have call successors, (84) [2025-03-17 15:31:03,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4547 states and 4981 transitions. [2025-03-17 15:31:03,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-17 15:31:03,610 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:31:03,610 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 21, 21, 21, 21, 21, 21, 19, 4, 4, 4, 3, 3, 3, 3, 3, 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:31:03,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-17 15:31:03,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 15:31:03,812 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:31:03,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:31:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash -541080741, now seen corresponding path program 3 times [2025-03-17 15:31:03,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:31:03,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666362653] [2025-03-17 15:31:03,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:31:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:31:03,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 279 statements into 20 equivalence classes. [2025-03-17 15:31:03,829 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 54 of 279 statements. [2025-03-17 15:31:03,831 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 15:31:03,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:31:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 2436 trivial. 0 not checked. [2025-03-17 15:31:03,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:31:03,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666362653] [2025-03-17 15:31:03,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666362653] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 15:31:03,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 15:31:03,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 15:31:03,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919673444] [2025-03-17 15:31:03,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 15:31:03,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 15:31:03,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:31:03,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 15:31:03,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 15:31:03,882 INFO L87 Difference]: Start difference. First operand 4547 states and 4981 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:31:04,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:31:04,249 INFO L93 Difference]: Finished difference Result 4585 states and 5019 transitions. [2025-03-17 15:31:04,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 15:31:04,250 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 279 [2025-03-17 15:31:04,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:31:04,266 INFO L225 Difference]: With dead ends: 4585 [2025-03-17 15:31:04,266 INFO L226 Difference]: Without dead ends: 4583 [2025-03-17 15:31:04,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-17 15:31:04,268 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 32 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 15:31:04,269 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 166 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 15:31:04,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2025-03-17 15:31:04,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4535. [2025-03-17 15:31:04,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 3630 states have (on average 1.1162534435261708) internal successors, (4052), 3636 states have internal predecessors, (4052), 456 states have call successors, (456), 446 states have call predecessors, (456), 446 states have return successors, (456), 452 states have call predecessors, (456), 456 states have call successors, (456) [2025-03-17 15:31:04,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 4964 transitions. [2025-03-17 15:31:04,520 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 4964 transitions. Word has length 279 [2025-03-17 15:31:04,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:31:04,520 INFO L471 AbstractCegarLoop]: Abstraction has 4535 states and 4964 transitions. [2025-03-17 15:31:04,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-17 15:31:04,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 4964 transitions. [2025-03-17 15:31:04,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2025-03-17 15:31:04,525 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 15:31:04,526 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 20, 20, 20, 19, 19, 19, 18, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 15:31:04,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 15:31:04,526 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 15:31:04,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 15:31:04,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1197843634, now seen corresponding path program 3 times [2025-03-17 15:31:04,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 15:31:04,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368786412] [2025-03-17 15:31:04,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:31:04,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 15:31:04,533 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 283 statements into 20 equivalence classes. [2025-03-17 15:31:04,539 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 58 of 283 statements. [2025-03-17 15:31:04,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 15:31:04,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:31:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2390 backedges. 151 proven. 1 refuted. 0 times theorem prover too weak. 2238 trivial. 0 not checked. [2025-03-17 15:31:04,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 15:31:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368786412] [2025-03-17 15:31:04,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368786412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 15:31:04,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751865678] [2025-03-17 15:31:04,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 15:31:04,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:31:04,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 15:31:04,635 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 15:31:04,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-17 15:31:04,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 283 statements into 20 equivalence classes. [2025-03-17 15:31:04,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 58 of 283 statements. [2025-03-17 15:31:04,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 15:31:04,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 15:31:04,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 15:31:04,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 15:31:04,718 INFO L134 CoverageAnalysis]: Checked inductivity of 2390 backedges. 247 proven. 1 refuted. 0 times theorem prover too weak. 2142 trivial. 0 not checked. [2025-03-17 15:31:04,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 15:31:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2390 backedges. 151 proven. 1 refuted. 0 times theorem prover too weak. 2238 trivial. 0 not checked. [2025-03-17 15:31:04,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751865678] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 15:31:04,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 15:31:04,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-03-17 15:31:04,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556816752] [2025-03-17 15:31:04,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 15:31:04,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 15:31:04,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 15:31:04,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 15:31:04,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-17 15:31:04,831 INFO L87 Difference]: Start difference. First operand 4535 states and 4964 transitions. Second operand has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 15:31:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 15:31:05,336 INFO L93 Difference]: Finished difference Result 4629 states and 5073 transitions. [2025-03-17 15:31:05,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 15:31:05,336 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 283 [2025-03-17 15:31:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 15:31:05,339 INFO L225 Difference]: With dead ends: 4629 [2025-03-17 15:31:05,339 INFO L226 Difference]: Without dead ends: 0 [2025-03-17 15:31:05,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 557 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=686, Unknown=0, NotChecked=0, Total=870 [2025-03-17 15:31:05,343 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 119 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 15:31:05,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 193 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 15:31:05,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-17 15:31:05,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-17 15:31:05,343 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:31:05,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-17 15:31:05,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2025-03-17 15:31:05,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 15:31:05,344 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-17 15:31:05,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.5294117647058822) internal successors, (60), 18 states have internal predecessors, (60), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-17 15:31:05,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-17 15:31:05,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-17 15:31:05,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-17 15:31:05,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-17 15:31:05,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-17 15:31:05,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-17 15:31:05,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-17 15:31:05,347 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-17 15:31:05,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-17 15:31:05,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 15:31:05,553 INFO L422 BasicCegarLoop]: Path program 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:31:05,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-17 15:31:15,930 WARN L286 SmtUtils]: Spent 10.20s on a formula simplification. DAG size of input: 772 DAG size of output: 178 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)