./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/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-?-798a7b3-m [2025-03-04 11:13:51,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:13:51,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:13:51,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:13:51,790 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:13:51,804 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:13:51,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:13:51,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:13:51,805 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:13:51,805 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:13:51,805 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:13:51,805 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:13:51,805 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:13:51,805 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:13:51,805 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:13:51,806 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:13:51,806 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:13:51,806 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:13:51,806 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:13:51,806 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:13:51,806 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:13:51,806 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:13:51,806 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:13:51,806 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:13:51,806 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:13:51,807 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:13:51,807 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:13:51,807 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:13:51,807 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:13:51,807 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:13:51,807 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:13:51,807 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:13:51,807 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:13:51,807 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:13:51,807 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:13:51,808 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:13:51,808 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:13:51,808 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:13:51,808 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:13:51,808 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:13:51,808 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:13:51,808 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:13:51,808 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:13:51,808 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:13:51,808 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:13:51,808 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-04 11:13:52,016 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:13:52,023 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:13:52,027 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:13:52,028 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:13:52,029 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:13:52,029 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-04 11:13:53,306 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207ed8751/fc15649b80b24e279c339eac49871d94/FLAGcdae2bc51 [2025-03-04 11:13:53,586 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:13:53,587 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/lcm1_unwindbound50.c [2025-03-04 11:13:53,594 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207ed8751/fc15649b80b24e279c339eac49871d94/FLAGcdae2bc51 [2025-03-04 11:13:53,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/207ed8751/fc15649b80b24e279c339eac49871d94 [2025-03-04 11:13:53,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:13:53,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:13:53,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:13:53,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:13:53,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:13:53,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,905 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4459ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:53, skipping insertion in model container [2025-03-04 11:13:53,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:13:53" (1/1) ... [2025-03-04 11:13:53,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:13:54,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:13:54,033 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:13:54,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:13:54,056 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:13:54,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54 WrapperNode [2025-03-04 11:13:54,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:13:54,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:13:54,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:13:54,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:13:54,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,079 INFO L138 Inliner]: procedures = 14, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2025-03-04 11:13:54,079 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:13:54,080 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:13:54,080 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:13:54,080 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:13:54,086 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,086 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,087 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,098 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-04 11:13:54,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,100 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,101 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,102 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:13:54,103 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:13:54,103 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:13:54,103 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:13:54,104 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (1/1) ... [2025-03-04 11:13:54,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:13:54,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:54,129 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:13:54,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:13:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:13:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 11:13:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 11:13:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:13:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:13:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:13:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:13:54,147 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 11:13:54,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 11:13:54,190 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:13:54,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:13:54,368 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2025-03-04 11:13:54,369 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:13:54,382 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:13:54,383 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:13:54,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:54 BoogieIcfgContainer [2025-03-04 11:13:54,383 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:13:54,385 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:13:54,385 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:13:54,390 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:13:54,391 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:13:53" (1/3) ... [2025-03-04 11:13:54,392 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d3142e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:13:54, skipping insertion in model container [2025-03-04 11:13:54,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:13:54" (2/3) ... [2025-03-04 11:13:54,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d3142e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:13:54, skipping insertion in model container [2025-03-04 11:13:54,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:13:54" (3/3) ... [2025-03-04 11:13:54,394 INFO L128 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound50.c [2025-03-04 11:13:54,409 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:13:54,410 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG lcm1_unwindbound50.c that has 3 procedures, 47 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 11:13:54,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:13:54,475 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;@acd3264, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:13:54,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 11:13:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 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-04 11:13:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:13:54,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:54,487 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:54,487 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-04 11:13:54,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:54,492 INFO L85 PathProgramCache]: Analyzing trace with hash -867382927, now seen corresponding path program 1 times [2025-03-04 11:13:54,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:54,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89979534] [2025-03-04 11:13:54,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:54,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:54,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:54,576 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,576 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:13:54,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:54,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89979534] [2025-03-04 11:13:54,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89979534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:54,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380752765] [2025-03-04 11:13:54,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:54,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:54,632 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:13:54,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:13:54,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:54,694 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:54,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:54,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:54,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 11:13:54,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:54,706 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 11:13:54,706 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:13:54,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380752765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:54,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:13:54,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 11:13:54,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227223576] [2025-03-04 11:13:54,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:54,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 11:13:54,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:54,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 11:13:54,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:13:54,726 INFO L87 Difference]: Start difference. First operand has 47 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 35 states have internal predecessors, (46), 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 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:13:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:54,742 INFO L93 Difference]: Finished difference Result 90 states and 132 transitions. [2025-03-04 11:13:54,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 11:13:54,743 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-04 11:13:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:54,747 INFO L225 Difference]: With dead ends: 90 [2025-03-04 11:13:54,747 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 11:13:54,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 11:13:54,753 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:54,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:54,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 11:13:54,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 11:13:54,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 29 states have internal predecessors, (34), 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-04 11:13:54,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2025-03-04 11:13:54,780 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 25 [2025-03-04 11:13:54,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:54,780 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2025-03-04 11:13:54,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 11:13:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2025-03-04 11:13:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 11:13:54,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:54,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:13:54,789 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 11:13:54,983 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,SelfDestructingSolverStorable0 [2025-03-04 11:13:54,983 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:54,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:54,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1360078897, now seen corresponding path program 1 times [2025-03-04 11:13:54,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:54,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964267349] [2025-03-04 11:13:54,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:54,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:54,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 11:13:55,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 11:13:55,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:55,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:55,136 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-04 11:13:55,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:55,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964267349] [2025-03-04 11:13:55,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964267349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:55,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:55,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:13:55,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655353116] [2025-03-04 11:13:55,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:55,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:13:55,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:55,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:13:55,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:55,140 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04 11:13:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:55,177 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2025-03-04 11:13:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 11:13:55,178 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 25 [2025-03-04 11:13:55,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:55,179 INFO L225 Difference]: With dead ends: 45 [2025-03-04 11:13:55,179 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 11:13:55,179 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-04 11:13:55,179 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:55,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 11:13:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2025-03-04 11:13:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 32 states have internal predecessors, (37), 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-04 11:13:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2025-03-04 11:13:55,192 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 25 [2025-03-04 11:13:55,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:55,193 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2025-03-04 11:13:55,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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-04 11:13:55,193 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2025-03-04 11:13:55,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 11:13:55,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:55,194 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-04 11:13:55,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:13:55,194 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:55,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:55,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1700255200, now seen corresponding path program 1 times [2025-03-04 11:13:55,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:55,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103022731] [2025-03-04 11:13:55,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:55,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:55,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 11:13:55,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 11:13:55,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:55,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:55,361 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-04 11:13:55,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:55,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103022731] [2025-03-04 11:13:55,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103022731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:55,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:55,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:13:55,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917928012] [2025-03-04 11:13:55,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:55,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:13:55,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:55,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:13:55,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:13:55,365 INFO L87 Difference]: Start difference. First operand 42 states and 51 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-04 11:13:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:55,510 INFO L93 Difference]: Finished difference Result 62 states and 74 transitions. [2025-03-04 11:13:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:13:55,511 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-04 11:13:55,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:55,511 INFO L225 Difference]: With dead ends: 62 [2025-03-04 11:13:55,513 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 11:13:55,513 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-04 11:13:55,514 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 28 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:55,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 177 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:55,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 11:13:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-04 11:13:55,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 42 states have internal predecessors, (50), 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-04 11:13:55,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2025-03-04 11:13:55,522 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 35 [2025-03-04 11:13:55,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:55,522 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2025-03-04 11:13:55,523 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-04 11:13:55,523 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2025-03-04 11:13:55,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-04 11:13:55,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:55,523 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, 1] [2025-03-04 11:13:55,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:13:55,524 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:55,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:55,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1168303653, now seen corresponding path program 1 times [2025-03-04 11:13:55,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:55,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65177133] [2025-03-04 11:13:55,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:55,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-04 11:13:55,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-04 11:13:55,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:55,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:55,664 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-04 11:13:55,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:55,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65177133] [2025-03-04 11:13:55,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65177133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:55,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:55,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 11:13:55,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637703290] [2025-03-04 11:13:55,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:55,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:13:55,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:55,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:13:55,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:13:55,667 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:55,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:55,742 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2025-03-04 11:13:55,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 11:13:55,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 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 36 [2025-03-04 11:13:55,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:55,743 INFO L225 Difference]: With dead ends: 91 [2025-03-04 11:13:55,744 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 11:13:55,744 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-04 11:13:55,744 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:55,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 144 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:55,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 11:13:55,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 11:13:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 49 states have internal predecessors, (57), 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-04 11:13:55,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2025-03-04 11:13:55,752 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 36 [2025-03-04 11:13:55,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:55,754 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2025-03-04 11:13:55,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 11:13:55,754 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2025-03-04 11:13:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:13:55,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:55,755 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-04 11:13:55,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 11:13:55,756 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:55,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1272493830, now seen corresponding path program 1 times [2025-03-04 11:13:55,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:55,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543899188] [2025-03-04 11:13:55,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:55,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:13:55,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:13:55,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:55,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:55,898 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-04 11:13:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543899188] [2025-03-04 11:13:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543899188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:55,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:55,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:13:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354784849] [2025-03-04 11:13:55,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:55,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:13:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:55,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:13:55,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:55,899 INFO L87 Difference]: Start difference. First operand 63 states and 75 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-04 11:13:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:56,080 INFO L93 Difference]: Finished difference Result 81 states and 94 transitions. [2025-03-04 11:13:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:13:56,081 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-04 11:13:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:56,081 INFO L225 Difference]: With dead ends: 81 [2025-03-04 11:13:56,081 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 11:13:56,082 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-04 11:13:56,082 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 40 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:56,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 232 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:56,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 11:13:56,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2025-03-04 11:13:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 57 states have internal predecessors, (68), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 11:13:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2025-03-04 11:13:56,094 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 45 [2025-03-04 11:13:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:56,094 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2025-03-04 11:13:56,095 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-04 11:13:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2025-03-04 11:13:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:13:56,095 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:56,096 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, 1] [2025-03-04 11:13:56,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:13:56,096 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:56,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:56,097 INFO L85 PathProgramCache]: Analyzing trace with hash 792603048, now seen corresponding path program 1 times [2025-03-04 11:13:56,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:56,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897784060] [2025-03-04 11:13:56,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:56,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:56,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:56,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:56,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:56,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:56,211 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-04 11:13:56,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:56,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897784060] [2025-03-04 11:13:56,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897784060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:56,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:56,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:13:56,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916402430] [2025-03-04 11:13:56,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:56,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:13:56,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:56,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:13:56,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:13:56,213 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-04 11:13:56,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:56,352 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2025-03-04 11:13:56,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 11:13:56,353 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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 46 [2025-03-04 11:13:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:56,354 INFO L225 Difference]: With dead ends: 115 [2025-03-04 11:13:56,354 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 11:13:56,355 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-04 11:13:56,358 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 33 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:56,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 186 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:13:56,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 11:13:56,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-04 11:13:56,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 60 states have (on average 1.2833333333333334) internal successors, (77), 65 states have internal predecessors, (77), 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-04 11:13:56,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 99 transitions. [2025-03-04 11:13:56,379 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 99 transitions. Word has length 46 [2025-03-04 11:13:56,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:56,379 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 99 transitions. [2025-03-04 11:13:56,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-04 11:13:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 99 transitions. [2025-03-04 11:13:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 11:13:56,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:56,380 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, 1] [2025-03-04 11:13:56,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:13:56,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:56,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:56,380 INFO L85 PathProgramCache]: Analyzing trace with hash 792675539, now seen corresponding path program 1 times [2025-03-04 11:13:56,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:56,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195750085] [2025-03-04 11:13:56,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:56,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:56,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:56,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:56,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:56,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:56,506 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-04 11:13:56,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:56,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195750085] [2025-03-04 11:13:56,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195750085] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:56,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104020376] [2025-03-04 11:13:56,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:56,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:56,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:56,509 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:13:56,510 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:13:56,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 11:13:56,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 11:13:56,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:56,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:56,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 11:13:56,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:56,657 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-04 11:13:56,657 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:56,774 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-04 11:13:56,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104020376] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:56,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:56,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2025-03-04 11:13:56,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878789120] [2025-03-04 11:13:56,775 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:56,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 11:13:56,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:56,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 11:13:56,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2025-03-04 11:13:56,776 INFO L87 Difference]: Start difference. First operand 83 states and 99 transitions. Second operand has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 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-04 11:13:57,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:57,252 INFO L93 Difference]: Finished difference Result 233 states and 283 transitions. [2025-03-04 11:13:57,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:13:57,253 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 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 46 [2025-03-04 11:13:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:57,254 INFO L225 Difference]: With dead ends: 233 [2025-03-04 11:13:57,254 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 11:13:57,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 81 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-04 11:13:57,255 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 114 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:57,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 289 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:13:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 11:13:57,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 163. [2025-03-04 11:13:57,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 125 states have (on average 1.272) internal successors, (159), 130 states have internal predecessors, (159), 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-04 11:13:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 195 transitions. [2025-03-04 11:13:57,270 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 195 transitions. Word has length 46 [2025-03-04 11:13:57,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:57,270 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 195 transitions. [2025-03-04 11:13:57,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 19 states have internal predecessors, (55), 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-04 11:13:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2025-03-04 11:13:57,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 11:13:57,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:57,274 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, 1] [2025-03-04 11:13:57,286 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:13:57,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 11:13:57,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:57,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:57,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1498090115, now seen corresponding path program 1 times [2025-03-04 11:13:57,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:57,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349905803] [2025-03-04 11:13:57,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:57,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:57,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 11:13:57,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 11:13:57,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:57,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:57,534 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-04 11:13:57,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:57,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349905803] [2025-03-04 11:13:57,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349905803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:13:57,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:13:57,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:13:57,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061525276] [2025-03-04 11:13:57,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:13:57,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:13:57,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:57,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:13:57,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:13:57,535 INFO L87 Difference]: Start difference. First operand 163 states and 195 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-04 11:13:57,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:57,587 INFO L93 Difference]: Finished difference Result 270 states and 329 transitions. [2025-03-04 11:13:57,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:13:57,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 55 [2025-03-04 11:13:57,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:57,589 INFO L225 Difference]: With dead ends: 270 [2025-03-04 11:13:57,589 INFO L226 Difference]: Without dead ends: 205 [2025-03-04 11:13:57,589 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-04 11:13:57,590 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 32 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:57,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 172 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:13:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2025-03-04 11:13:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 183. [2025-03-04 11:13:57,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 141 states have (on average 1.2907801418439717) internal successors, (182), 146 states have internal predecessors, (182), 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-04 11:13:57,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 226 transitions. [2025-03-04 11:13:57,613 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 226 transitions. Word has length 55 [2025-03-04 11:13:57,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:57,613 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 226 transitions. [2025-03-04 11:13:57,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-04 11:13:57,613 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 226 transitions. [2025-03-04 11:13:57,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-04 11:13:57,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:57,614 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, 1] [2025-03-04 11:13:57,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:13:57,614 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:13:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash -803810935, now seen corresponding path program 1 times [2025-03-04 11:13:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:57,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936289419] [2025-03-04 11:13:57,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:57,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:57,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:13:57,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:13:57,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:57,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:57,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-04 11:13:57,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936289419] [2025-03-04 11:13:57,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936289419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:57,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032866280] [2025-03-04 11:13:57,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:57,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:57,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:57,747 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:13:57,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:13:57,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 11:13:57,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 11:13:57,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:57,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:57,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:13:57,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:57,898 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-04 11:13:57,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:58,035 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-04 11:13:58,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032866280] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:58,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:58,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-04 11:13:58,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358597638] [2025-03-04 11:13:58,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:58,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 11:13:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:58,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 11:13:58,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=469, Unknown=0, NotChecked=0, Total=600 [2025-03-04 11:13:58,037 INFO L87 Difference]: Start difference. First operand 183 states and 226 transitions. Second operand has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 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-04 11:13:58,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:13:58,895 INFO L93 Difference]: Finished difference Result 379 states and 473 transitions. [2025-03-04 11:13:58,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-04 11:13:58,895 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 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 56 [2025-03-04 11:13:58,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:13:58,897 INFO L225 Difference]: With dead ends: 379 [2025-03-04 11:13:58,897 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 11:13:58,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 97 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-04 11:13:58,898 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 175 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:13:58,898 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 327 Invalid, 457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:13:58,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 11:13:58,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 263. [2025-03-04 11:13:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 206 states have (on average 1.2766990291262137) internal successors, (263), 211 states have internal predecessors, (263), 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-04 11:13:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 321 transitions. [2025-03-04 11:13:58,918 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 321 transitions. Word has length 56 [2025-03-04 11:13:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:13:58,919 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 321 transitions. [2025-03-04 11:13:58,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.0416666666666665) internal successors, (73), 25 states have internal predecessors, (73), 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-04 11:13:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 321 transitions. [2025-03-04 11:13:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-04 11:13:58,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:13:58,922 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, 1] [2025-03-04 11:13:58,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:13:59,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:59,123 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-04 11:13:59,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:13:59,124 INFO L85 PathProgramCache]: Analyzing trace with hash -281102517, now seen corresponding path program 1 times [2025-03-04 11:13:59,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:13:59,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518323299] [2025-03-04 11:13:59,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:59,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:13:59,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:13:59,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:13:59,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:59,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:59,248 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-04 11:13:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:13:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518323299] [2025-03-04 11:13:59,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518323299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:13:59,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391786243] [2025-03-04 11:13:59,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:13:59,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:13:59,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:13:59,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:13:59,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:13:59,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-04 11:13:59,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-04 11:13:59,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:13:59,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:13:59,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 11:13:59,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:13:59,371 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-04 11:13:59,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:13:59,509 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-04 11:13:59,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391786243] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:13:59,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:13:59,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 10] total 21 [2025-03-04 11:13:59,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379015042] [2025-03-04 11:13:59,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:13:59,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-04 11:13:59,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:13:59,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-04 11:13:59,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2025-03-04 11:13:59,511 INFO L87 Difference]: Start difference. First operand 263 states and 321 transitions. Second operand has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 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-04 11:14:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:00,011 INFO L93 Difference]: Finished difference Result 471 states and 581 transitions. [2025-03-04 11:14:00,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 11:14:00,012 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 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 59 [2025-03-04 11:14:00,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:00,014 INFO L225 Difference]: With dead ends: 471 [2025-03-04 11:14:00,014 INFO L226 Difference]: Without dead ends: 332 [2025-03-04 11:14:00,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=299, Invalid=1183, Unknown=0, NotChecked=0, Total=1482 [2025-03-04 11:14:00,015 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 118 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:00,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 313 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:14:00,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-03-04 11:14:00,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 323. [2025-03-04 11:14:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 258 states have (on average 1.244186046511628) internal successors, (321), 263 states have internal predecessors, (321), 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-04 11:14:00,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 387 transitions. [2025-03-04 11:14:00,029 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 387 transitions. Word has length 59 [2025-03-04 11:14:00,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:00,029 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 387 transitions. [2025-03-04 11:14:00,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.380952380952381) internal successors, (71), 21 states have internal predecessors, (71), 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-04 11:14:00,029 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 387 transitions. [2025-03-04 11:14:00,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 11:14:00,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:00,030 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, 1] [2025-03-04 11:14:00,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:00,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:00,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:00,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:00,235 INFO L85 PathProgramCache]: Analyzing trace with hash -926240830, now seen corresponding path program 1 times [2025-03-04 11:14:00,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:00,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666267971] [2025-03-04 11:14:00,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:00,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:14:00,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:14:00,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:00,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:00,389 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-04 11:14:00,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:00,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666267971] [2025-03-04 11:14:00,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666267971] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:00,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291791295] [2025-03-04 11:14:00,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:00,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:00,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:00,391 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:00,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:14:00,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 11:14:00,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 11:14:00,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:00,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:00,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:14:00,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:00,556 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-04 11:14:00,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:14:00,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291791295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:00,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:14:00,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 21 [2025-03-04 11:14:00,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662980030] [2025-03-04 11:14:00,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:00,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 11:14:00,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:00,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 11:14:00,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:14:00,559 INFO L87 Difference]: Start difference. First operand 323 states and 387 transitions. Second operand has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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-04 11:14:00,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:00,863 INFO L93 Difference]: Finished difference Result 391 states and 469 transitions. [2025-03-04 11:14:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 11:14:00,863 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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 65 [2025-03-04 11:14:00,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:00,865 INFO L225 Difference]: With dead ends: 391 [2025-03-04 11:14:00,865 INFO L226 Difference]: Without dead ends: 388 [2025-03-04 11:14:00,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 58 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-04 11:14:00,868 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:00,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 141 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:14:00,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2025-03-04 11:14:00,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 293. [2025-03-04 11:14:00,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 234 states have (on average 1.1623931623931625) internal successors, (272), 237 states have internal predecessors, (272), 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-04 11:14:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 334 transitions. [2025-03-04 11:14:00,888 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 334 transitions. Word has length 65 [2025-03-04 11:14:00,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:00,888 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 334 transitions. [2025-03-04 11:14:00,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.0) internal successors, (40), 11 states have internal predecessors, (40), 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-04 11:14:00,888 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 334 transitions. [2025-03-04 11:14:00,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 11:14:00,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:00,889 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, 1] [2025-03-04 11:14:00,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:01,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 11:14:01,093 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:01,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:01,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1351305348, now seen corresponding path program 1 times [2025-03-04 11:14:01,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:01,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52605633] [2025-03-04 11:14:01,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:01,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:01,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:14:01,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:14:01,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:01,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:01,270 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-04 11:14:01,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:01,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52605633] [2025-03-04 11:14:01,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52605633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:01,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [930671581] [2025-03-04 11:14:01,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:01,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:01,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:01,274 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:01,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:14:01,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 11:14:01,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 11:14:01,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:01,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:01,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 11:14:01,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:01,439 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-04 11:14:01,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:01,604 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-04 11:14:01,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [930671581] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:01,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:01,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 30 [2025-03-04 11:14:01,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940987145] [2025-03-04 11:14:01,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:01,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 11:14:01,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:01,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 11:14:01,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=740, Unknown=0, NotChecked=0, Total=930 [2025-03-04 11:14:01,606 INFO L87 Difference]: Start difference. First operand 293 states and 334 transitions. Second operand has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 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-04 11:14:02,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:02,655 INFO L93 Difference]: Finished difference Result 332 states and 381 transitions. [2025-03-04 11:14:02,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 11:14:02,655 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 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 66 [2025-03-04 11:14:02,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:02,658 INFO L225 Difference]: With dead ends: 332 [2025-03-04 11:14:02,658 INFO L226 Difference]: Without dead ends: 331 [2025-03-04 11:14:02,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 113 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-04 11:14:02,659 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 184 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:02,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 351 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:14:02,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-03-04 11:14:02,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 306. [2025-03-04 11:14:02,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 245 states have (on average 1.1591836734693877) internal successors, (284), 248 states have internal predecessors, (284), 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-04 11:14:02,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 348 transitions. [2025-03-04 11:14:02,682 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 348 transitions. Word has length 66 [2025-03-04 11:14:02,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:02,683 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 348 transitions. [2025-03-04 11:14:02,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 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-04 11:14:02,683 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 348 transitions. [2025-03-04 11:14:02,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:14:02,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:02,685 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, 1] [2025-03-04 11:14:02,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 11:14:02,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:02,885 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-04 11:14:02,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:02,886 INFO L85 PathProgramCache]: Analyzing trace with hash -417891471, now seen corresponding path program 1 times [2025-03-04 11:14:02,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:02,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430727818] [2025-03-04 11:14:02,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:02,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:14:02,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:14:02,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:02,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:03,093 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-04 11:14:03,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430727818] [2025-03-04 11:14:03,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430727818] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:03,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973880795] [2025-03-04 11:14:03,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:03,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:03,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:03,096 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:03,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:14:03,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:14:03,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:14:03,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:03,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:03,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 11:14:03,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:03,234 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-04 11:14:03,235 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:03,431 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-04 11:14:03,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [973880795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:03,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:03,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 29 [2025-03-04 11:14:03,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707418426] [2025-03-04 11:14:03,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:03,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 11:14:03,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:03,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 11:14:03,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=617, Unknown=0, NotChecked=0, Total=812 [2025-03-04 11:14:03,433 INFO L87 Difference]: Start difference. First operand 306 states and 348 transitions. Second operand has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 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-04 11:14:04,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:04,048 INFO L93 Difference]: Finished difference Result 542 states and 628 transitions. [2025-03-04 11:14:04,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-04 11:14:04,049 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 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 80 [2025-03-04 11:14:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:04,050 INFO L225 Difference]: With dead ends: 542 [2025-03-04 11:14:04,050 INFO L226 Difference]: Without dead ends: 383 [2025-03-04 11:14:04,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 146 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-04 11:14:04,052 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 173 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:04,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 375 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:14:04,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-03-04 11:14:04,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 360. [2025-03-04 11:14:04,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 289 states have (on average 1.1522491349480968) internal successors, (333), 292 states have internal predecessors, (333), 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-04 11:14:04,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 407 transitions. [2025-03-04 11:14:04,073 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 407 transitions. Word has length 80 [2025-03-04 11:14:04,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:04,073 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 407 transitions. [2025-03-04 11:14:04,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.3793103448275863) internal successors, (98), 29 states have internal predecessors, (98), 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-04 11:14:04,074 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 407 transitions. [2025-03-04 11:14:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:14:04,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:04,075 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, 1] [2025-03-04 11:14:04,081 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-04 11:14:04,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:04,279 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:04,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:04,279 INFO L85 PathProgramCache]: Analyzing trace with hash -312192998, now seen corresponding path program 1 times [2025-03-04 11:14:04,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:04,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965377408] [2025-03-04 11:14:04,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:04,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:04,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:14:04,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:14:04,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:04,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:04,498 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-04 11:14:04,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:04,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965377408] [2025-03-04 11:14:04,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965377408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:04,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784643442] [2025-03-04 11:14:04,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:04,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:04,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:04,500 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:04,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:14:04,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:14:04,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:14:04,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:04,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:04,544 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:14:04,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:04,742 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-04 11:14:04,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:05,025 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-04 11:14:05,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784643442] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:05,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:05,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-04 11:14:05,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001468305] [2025-03-04 11:14:05,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:05,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 11:14:05,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:05,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 11:14:05,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1444, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:14:05,027 INFO L87 Difference]: Start difference. First operand 360 states and 407 transitions. Second operand has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 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-04 11:14:06,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:06,573 INFO L93 Difference]: Finished difference Result 776 states and 906 transitions. [2025-03-04 11:14:06,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-03-04 11:14:06,573 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 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 86 [2025-03-04 11:14:06,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:06,576 INFO L225 Difference]: With dead ends: 776 [2025-03-04 11:14:06,577 INFO L226 Difference]: Without dead ends: 617 [2025-03-04 11:14:06,579 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1770, Invalid=7350, Unknown=0, NotChecked=0, Total=9120 [2025-03-04 11:14:06,580 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 546 mSDsluCounter, 338 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:06,580 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 369 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:14:06,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-03-04 11:14:06,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 556. [2025-03-04 11:14:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 445 states have (on average 1.1752808988764045) internal successors, (523), 448 states have internal predecessors, (523), 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-04 11:14:06,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 637 transitions. [2025-03-04 11:14:06,630 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 637 transitions. Word has length 86 [2025-03-04 11:14:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:06,631 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 637 transitions. [2025-03-04 11:14:06,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 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-04 11:14:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 637 transitions. [2025-03-04 11:14:06,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 11:14:06,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:06,632 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, 1] [2025-03-04 11:14:06,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:14:06,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 11:14:06,833 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-04 11:14:06,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:06,833 INFO L85 PathProgramCache]: Analyzing trace with hash -381304629, now seen corresponding path program 1 times [2025-03-04 11:14:06,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:06,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392711007] [2025-03-04 11:14:06,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:06,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:14:06,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:14:06,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:06,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:06,995 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-04 11:14:06,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:06,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392711007] [2025-03-04 11:14:06,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392711007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:06,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811297550] [2025-03-04 11:14:06,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:06,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:06,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:06,998 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:06,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:14:07,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 11:14:07,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 11:14:07,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:07,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:07,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 11:14:07,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:07,245 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-04 11:14:07,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:07,511 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-04 11:14:07,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811297550] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:07,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:07,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 42 [2025-03-04 11:14:07,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116398899] [2025-03-04 11:14:07,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:07,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-04 11:14:07,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:07,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-04 11:14:07,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=1438, Unknown=0, NotChecked=0, Total=1806 [2025-03-04 11:14:07,516 INFO L87 Difference]: Start difference. First operand 556 states and 637 transitions. Second operand has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 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-04 11:14:08,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:08,938 INFO L93 Difference]: Finished difference Result 716 states and 822 transitions. [2025-03-04 11:14:08,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-03-04 11:14:08,939 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 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 86 [2025-03-04 11:14:08,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:08,941 INFO L225 Difference]: With dead ends: 716 [2025-03-04 11:14:08,941 INFO L226 Difference]: Without dead ends: 713 [2025-03-04 11:14:08,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1656, Invalid=6716, Unknown=0, NotChecked=0, Total=8372 [2025-03-04 11:14:08,946 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 347 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:08,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 387 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:14:08,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2025-03-04 11:14:08,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 608. [2025-03-04 11:14:08,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 485 states have (on average 1.1814432989690722) internal successors, (573), 488 states have internal predecessors, (573), 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-04 11:14:08,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 699 transitions. [2025-03-04 11:14:08,972 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 699 transitions. Word has length 86 [2025-03-04 11:14:08,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:08,972 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 699 transitions. [2025-03-04 11:14:08,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 3.0238095238095237) internal successors, (127), 43 states have internal predecessors, (127), 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-04 11:14:08,972 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 699 transitions. [2025-03-04 11:14:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-04 11:14:08,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:08,973 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, 1] [2025-03-04 11:14:08,980 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:14:09,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 11:14:09,174 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-04 11:14:09,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:09,175 INFO L85 PathProgramCache]: Analyzing trace with hash -707708897, now seen corresponding path program 1 times [2025-03-04 11:14:09,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:09,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606451302] [2025-03-04 11:14:09,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:09,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:14:09,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:14:09,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:09,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:09,406 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-04 11:14:09,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606451302] [2025-03-04 11:14:09,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606451302] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:09,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767129467] [2025-03-04 11:14:09,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:09,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:09,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:09,408 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:09,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 11:14:09,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 11:14:09,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 11:14:09,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:09,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:09,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 11:14:09,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:09,558 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-04 11:14:09,558 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:09,789 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-04 11:14:09,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767129467] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:09,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:09,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 37 [2025-03-04 11:14:09,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120251931] [2025-03-04 11:14:09,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:09,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 11:14:09,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:09,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 11:14:09,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=1053, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 11:14:09,791 INFO L87 Difference]: Start difference. First operand 608 states and 699 transitions. Second operand has 37 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 37 states have internal predecessors, (124), 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-04 11:14:10,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:10,774 INFO L93 Difference]: Finished difference Result 1131 states and 1314 transitions. [2025-03-04 11:14:10,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-04 11:14:10,775 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 37 states have internal predecessors, (124), 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 100 [2025-03-04 11:14:10,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:10,779 INFO L225 Difference]: With dead ends: 1131 [2025-03-04 11:14:10,779 INFO L226 Difference]: Without dead ends: 842 [2025-03-04 11:14:10,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 182 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-04 11:14:10,782 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 216 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:10,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 588 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 11:14:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2025-03-04 11:14:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 758. [2025-03-04 11:14:10,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 605 states have (on average 1.1586776859504133) internal successors, (701), 608 states have internal predecessors, (701), 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-04 11:14:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 857 transitions. [2025-03-04 11:14:10,835 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 857 transitions. Word has length 100 [2025-03-04 11:14:10,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:10,836 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 857 transitions. [2025-03-04 11:14:10,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 3.3513513513513513) internal successors, (124), 37 states have internal predecessors, (124), 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-04 11:14:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 857 transitions. [2025-03-04 11:14:10,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 11:14:10,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:10,837 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, 1] [2025-03-04 11:14:10,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 11:14:11,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 11:14:11,038 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:11,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:11,038 INFO L85 PathProgramCache]: Analyzing trace with hash -801127946, now seen corresponding path program 1 times [2025-03-04 11:14:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:11,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649277709] [2025-03-04 11:14:11,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:11,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:11,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:14:11,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:14:11,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:11,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:11,317 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-04 11:14:11,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:11,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649277709] [2025-03-04 11:14:11,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649277709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:11,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1276733290] [2025-03-04 11:14:11,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:11,317 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:11,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:11,320 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:11,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 11:14:11,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 11:14:11,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 11:14:11,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:11,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:11,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 11:14:11,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:11,665 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-04 11:14:11,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:12,008 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-04 11:14:12,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1276733290] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:12,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:12,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2025-03-04 11:14:12,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650762166] [2025-03-04 11:14:12,008 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:12,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 11:14:12,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:12,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 11:14:12,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=2406, Unknown=0, NotChecked=0, Total=2970 [2025-03-04 11:14:12,010 INFO L87 Difference]: Start difference. First operand 758 states and 857 transitions. Second operand has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 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-04 11:14:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:13,954 INFO L93 Difference]: Finished difference Result 927 states and 1052 transitions. [2025-03-04 11:14:13,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2025-03-04 11:14:13,955 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 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 106 [2025-03-04 11:14:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:13,958 INFO L225 Difference]: With dead ends: 927 [2025-03-04 11:14:13,958 INFO L226 Difference]: Without dead ends: 925 [2025-03-04 11:14:13,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 177 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-04 11:14:13,961 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 515 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:13,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 416 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 11:14:13,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2025-03-04 11:14:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 624. [2025-03-04 11:14:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 497 states have (on average 1.1609657947686116) internal successors, (577), 501 states have internal predecessors, (577), 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-04 11:14:13,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 707 transitions. [2025-03-04 11:14:13,991 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 707 transitions. Word has length 106 [2025-03-04 11:14:13,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:13,992 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 707 transitions. [2025-03-04 11:14:13,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.0185185185185186) internal successors, (163), 55 states have internal predecessors, (163), 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-04 11:14:13,993 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 707 transitions. [2025-03-04 11:14:13,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-04 11:14:13,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:13,996 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, 1] [2025-03-04 11:14:14,003 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 11:14:14,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:14:14,197 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:14,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:14,197 INFO L85 PathProgramCache]: Analyzing trace with hash -618230404, now seen corresponding path program 2 times [2025-03-04 11:14:14,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:14,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055940293] [2025-03-04 11:14:14,197 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:14,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:14,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 146 statements into 2 equivalence classes. [2025-03-04 11:14:14,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 146 of 146 statements. [2025-03-04 11:14:14,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:14,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:14,368 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-04 11:14:14,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:14,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055940293] [2025-03-04 11:14:14,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055940293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:14,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:14,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:14,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666138162] [2025-03-04 11:14:14,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:14,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:14,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:14,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:14,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:14,369 INFO L87 Difference]: Start difference. First operand 624 states and 707 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-04 11:14:14,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:14,474 INFO L93 Difference]: Finished difference Result 638 states and 721 transitions. [2025-03-04 11:14:14,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:14:14,475 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 146 [2025-03-04 11:14:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:14,478 INFO L225 Difference]: With dead ends: 638 [2025-03-04 11:14:14,480 INFO L226 Difference]: Without dead ends: 637 [2025-03-04 11:14:14,480 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-04 11:14:14,481 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:14,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 133 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:14,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2025-03-04 11:14:14,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 624. [2025-03-04 11:14:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 497 states have (on average 1.158953722334004) internal successors, (576), 501 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-04 11:14:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 706 transitions. [2025-03-04 11:14:14,508 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 706 transitions. Word has length 146 [2025-03-04 11:14:14,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:14,509 INFO L471 AbstractCegarLoop]: Abstraction has 624 states and 706 transitions. [2025-03-04 11:14:14,509 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-04 11:14:14,509 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 706 transitions. [2025-03-04 11:14:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-04 11:14:14,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:14,511 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, 1] [2025-03-04 11:14:14,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 11:14:14,511 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:14,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:14,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1578962185, now seen corresponding path program 2 times [2025-03-04 11:14:14,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:14,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197169618] [2025-03-04 11:14:14,511 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:14,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:14,518 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 11:14:14,534 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 11:14:14,534 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:14,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:15,004 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-04 11:14:15,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197169618] [2025-03-04 11:14:15,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197169618] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:15,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419903775] [2025-03-04 11:14:15,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:15,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:15,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:15,007 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:15,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 11:14:15,038 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 11:14:15,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 11:14:15,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:15,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:15,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 11:14:15,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:15,222 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-04 11:14:15,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:15,754 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-04 11:14:15,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419903775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:15,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:15,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27, 28] total 57 [2025-03-04 11:14:15,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066311610] [2025-03-04 11:14:15,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:15,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-04 11:14:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:15,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-04 11:14:15,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=629, Invalid=2563, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 11:14:15,757 INFO L87 Difference]: Start difference. First operand 624 states and 706 transitions. Second operand has 57 states, 57 states have (on average 3.3157894736842106) internal successors, (189), 57 states have internal predecessors, (189), 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-04 11:14:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:17,681 INFO L93 Difference]: Finished difference Result 1489 states and 1718 transitions. [2025-03-04 11:14:17,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2025-03-04 11:14:17,682 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.3157894736842106) internal successors, (189), 57 states have internal predecessors, (189), 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 150 [2025-03-04 11:14:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:17,688 INFO L225 Difference]: With dead ends: 1489 [2025-03-04 11:14:17,688 INFO L226 Difference]: Without dead ends: 1224 [2025-03-04 11:14:17,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 395 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4273 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3050, Invalid=12450, Unknown=0, NotChecked=0, Total=15500 [2025-03-04 11:14:17,691 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 411 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:17,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 577 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 11:14:17,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2025-03-04 11:14:17,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 898. [2025-03-04 11:14:17,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 717 states have (on average 1.1478382147838215) internal successors, (823), 721 states have internal predecessors, (823), 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-04 11:14:17,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1007 transitions. [2025-03-04 11:14:17,734 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1007 transitions. Word has length 150 [2025-03-04 11:14:17,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:17,735 INFO L471 AbstractCegarLoop]: Abstraction has 898 states and 1007 transitions. [2025-03-04 11:14:17,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.3157894736842106) internal successors, (189), 57 states have internal predecessors, (189), 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-04 11:14:17,735 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1007 transitions. [2025-03-04 11:14:17,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-04 11:14:17,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:17,737 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, 1] [2025-03-04 11:14:17,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 11:14:17,938 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-04 11:14:17,939 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:17,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:17,940 INFO L85 PathProgramCache]: Analyzing trace with hash -333555862, now seen corresponding path program 1 times [2025-03-04 11:14:17,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:17,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782644129] [2025-03-04 11:14:17,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:17,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:17,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 11:14:17,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 11:14:17,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:17,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:18,480 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-04 11:14:18,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782644129] [2025-03-04 11:14:18,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782644129] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:18,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125307908] [2025-03-04 11:14:18,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:18,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:18,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:18,483 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:18,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 11:14:18,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 11:14:18,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 11:14:18,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:18,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:18,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-04 11:14:18,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:19,201 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-04 11:14:19,201 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:20,070 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-04 11:14:20,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125307908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:20,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:20,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 28, 28] total 84 [2025-03-04 11:14:20,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407374232] [2025-03-04 11:14:20,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:20,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2025-03-04 11:14:20,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:20,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2025-03-04 11:14:20,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1477, Invalid=5663, Unknown=0, NotChecked=0, Total=7140 [2025-03-04 11:14:20,076 INFO L87 Difference]: Start difference. First operand 898 states and 1007 transitions. Second operand has 85 states, 84 states have (on average 3.011904761904762) internal successors, (253), 85 states have internal predecessors, (253), 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-04 11:14:23,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:23,569 INFO L93 Difference]: Finished difference Result 1925 states and 2209 transitions. [2025-03-04 11:14:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2025-03-04 11:14:23,570 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 3.011904761904762) internal successors, (253), 85 states have internal predecessors, (253), 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 156 [2025-03-04 11:14:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:23,575 INFO L225 Difference]: With dead ends: 1925 [2025-03-04 11:14:23,575 INFO L226 Difference]: Without dead ends: 1660 [2025-03-04 11:14:23,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8378 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7279, Invalid=27131, Unknown=0, NotChecked=0, Total=34410 [2025-03-04 11:14:23,579 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 906 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:23,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 507 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-04 11:14:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2025-03-04 11:14:23,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1181. [2025-03-04 11:14:23,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1181 states, 944 states have (on average 1.1588983050847457) internal successors, (1094), 948 states have internal predecessors, (1094), 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-04 11:14:23,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1181 states to 1181 states and 1334 transitions. [2025-03-04 11:14:23,643 INFO L78 Accepts]: Start accepts. Automaton has 1181 states and 1334 transitions. Word has length 156 [2025-03-04 11:14:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:23,644 INFO L471 AbstractCegarLoop]: Abstraction has 1181 states and 1334 transitions. [2025-03-04 11:14:23,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 3.011904761904762) internal successors, (253), 85 states have internal predecessors, (253), 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-04 11:14:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1181 states and 1334 transitions. [2025-03-04 11:14:23,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-04 11:14:23,647 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:23,648 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, 1] [2025-03-04 11:14:23,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 11:14:23,848 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,SelfDestructingSolverStorable19 [2025-03-04 11:14:23,849 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-04 11:14:23,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 102111966, now seen corresponding path program 2 times [2025-03-04 11:14:23,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:23,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577062544] [2025-03-04 11:14:23,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:23,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:23,860 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 166 statements into 2 equivalence classes. [2025-03-04 11:14:23,869 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 166 of 166 statements. [2025-03-04 11:14:23,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:23,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:23,962 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-04 11:14:23,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:23,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577062544] [2025-03-04 11:14:23,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577062544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:23,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:23,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:23,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665855208] [2025-03-04 11:14:23,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:23,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:14:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:23,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:14:23,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:14:23,964 INFO L87 Difference]: Start difference. First operand 1181 states and 1334 transitions. Second operand has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-04 11:14:24,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:24,090 INFO L93 Difference]: Finished difference Result 1196 states and 1350 transitions. [2025-03-04 11:14:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:14:24,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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 166 [2025-03-04 11:14:24,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:24,095 INFO L225 Difference]: With dead ends: 1196 [2025-03-04 11:14:24,095 INFO L226 Difference]: Without dead ends: 1195 [2025-03-04 11:14:24,097 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-04 11:14:24,098 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 23 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:24,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 128 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:24,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2025-03-04 11:14:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1045. [2025-03-04 11:14:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 836 states have (on average 1.1626794258373205) internal successors, (972), 840 states have internal predecessors, (972), 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-04 11:14:24,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1184 transitions. [2025-03-04 11:14:24,165 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1184 transitions. Word has length 166 [2025-03-04 11:14:24,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:24,166 INFO L471 AbstractCegarLoop]: Abstraction has 1045 states and 1184 transitions. [2025-03-04 11:14:24,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.0) internal successors, (32), 5 states have internal predecessors, (32), 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-04 11:14:24,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1184 transitions. [2025-03-04 11:14:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 11:14:24,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:24,168 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, 1] [2025-03-04 11:14:24,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 11:14:24,168 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-04 11:14:24,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash -397707078, now seen corresponding path program 1 times [2025-03-04 11:14:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:24,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59436830] [2025-03-04 11:14:24,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:24,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:24,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 11:14:24,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 11:14:24,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:24,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:24,233 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-04 11:14:24,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:24,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59436830] [2025-03-04 11:14:24,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59436830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:24,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:24,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:24,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589002363] [2025-03-04 11:14:24,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:24,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:24,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:24,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:24,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:24,235 INFO L87 Difference]: Start difference. First operand 1045 states and 1184 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-04 11:14:24,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:24,295 INFO L93 Difference]: Finished difference Result 1480 states and 1701 transitions. [2025-03-04 11:14:24,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:24,296 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 170 [2025-03-04 11:14:24,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:24,300 INFO L225 Difference]: With dead ends: 1480 [2025-03-04 11:14:24,300 INFO L226 Difference]: Without dead ends: 1064 [2025-03-04 11:14:24,302 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-04 11:14:24,304 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 11 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 157 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-04 11:14:24,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 157 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:14:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-03-04 11:14:24,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1058. [2025-03-04 11:14:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1058 states, 847 states have (on average 1.1605667060212514) internal successors, (983), 852 states have internal predecessors, (983), 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-04 11:14:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1201 transitions. [2025-03-04 11:14:24,352 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1201 transitions. Word has length 170 [2025-03-04 11:14:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:24,352 INFO L471 AbstractCegarLoop]: Abstraction has 1058 states and 1201 transitions. [2025-03-04 11:14:24,353 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-04 11:14:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1201 transitions. [2025-03-04 11:14:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 11:14:24,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:24,355 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, 1] [2025-03-04 11:14:24,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 11:14:24,355 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-04 11:14:24,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:24,355 INFO L85 PathProgramCache]: Analyzing trace with hash 898582527, now seen corresponding path program 1 times [2025-03-04 11:14:24,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:24,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846766138] [2025-03-04 11:14:24,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:24,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:24,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 11:14:24,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 11:14:24,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:24,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:24,968 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-04 11:14:24,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846766138] [2025-03-04 11:14:24,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846766138] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:24,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446220578] [2025-03-04 11:14:24,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:24,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:24,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:24,971 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:24,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 11:14:25,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 11:14:25,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 11:14:25,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:25,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:25,036 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 11:14:25,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:25,223 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-04 11:14:25,223 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:25,828 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-04 11:14:25,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446220578] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:25,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:25,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 31, 32] total 65 [2025-03-04 11:14:25,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386053685] [2025-03-04 11:14:25,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:25,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-04 11:14:25,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:25,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-04 11:14:25,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=801, Invalid=3359, Unknown=0, NotChecked=0, Total=4160 [2025-03-04 11:14:25,830 INFO L87 Difference]: Start difference. First operand 1058 states and 1201 transitions. Second operand has 65 states, 65 states have (on average 3.3076923076923075) internal successors, (215), 65 states have internal predecessors, (215), 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-04 11:14:28,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:28,163 INFO L93 Difference]: Finished difference Result 2486 states and 2817 transitions. [2025-03-04 11:14:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2025-03-04 11:14:28,164 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.3076923076923075) internal successors, (215), 65 states have internal predecessors, (215), 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 170 [2025-03-04 11:14:28,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:28,170 INFO L225 Difference]: With dead ends: 2486 [2025-03-04 11:14:28,171 INFO L226 Difference]: Without dead ends: 2091 [2025-03-04 11:14:28,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 308 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-04 11:14:28,173 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 487 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:28,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 607 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-04 11:14:28,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2025-03-04 11:14:28,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1438. [2025-03-04 11:14:28,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1438 states, 1151 states have (on average 1.1442224152910512) internal successors, (1317), 1156 states have internal predecessors, (1317), 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-04 11:14:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1611 transitions. [2025-03-04 11:14:28,257 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1611 transitions. Word has length 170 [2025-03-04 11:14:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:28,257 INFO L471 AbstractCegarLoop]: Abstraction has 1438 states and 1611 transitions. [2025-03-04 11:14:28,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.3076923076923075) internal successors, (215), 65 states have internal predecessors, (215), 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-04 11:14:28,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1611 transitions. [2025-03-04 11:14:28,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 11:14:28,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:28,260 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, 1] [2025-03-04 11:14:28,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 11:14:28,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:28,461 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-04 11:14:28,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:28,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1185416644, now seen corresponding path program 1 times [2025-03-04 11:14:28,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:28,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853415850] [2025-03-04 11:14:28,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:28,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:28,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 11:14:28,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 11:14:28,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:28,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:28,543 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-04 11:14:28,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:28,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853415850] [2025-03-04 11:14:28,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853415850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:28,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:28,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:14:28,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359098157] [2025-03-04 11:14:28,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:28,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:14:28,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:28,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:14:28,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:14:28,545 INFO L87 Difference]: Start difference. First operand 1438 states and 1611 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:14:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:28,667 INFO L93 Difference]: Finished difference Result 2333 states and 2643 transitions. [2025-03-04 11:14:28,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:14:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 174 [2025-03-04 11:14:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:28,673 INFO L225 Difference]: With dead ends: 2333 [2025-03-04 11:14:28,674 INFO L226 Difference]: Without dead ends: 1490 [2025-03-04 11:14:28,675 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-04 11:14:28,676 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 13 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 151 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-04 11:14:28,676 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 151 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:28,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2025-03-04 11:14:28,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1470. [2025-03-04 11:14:28,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1470 states, 1178 states have (on average 1.1392190152801358) internal successors, (1342), 1184 states have internal predecessors, (1342), 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-04 11:14:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1470 states to 1470 states and 1646 transitions. [2025-03-04 11:14:28,757 INFO L78 Accepts]: Start accepts. Automaton has 1470 states and 1646 transitions. Word has length 174 [2025-03-04 11:14:28,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:28,757 INFO L471 AbstractCegarLoop]: Abstraction has 1470 states and 1646 transitions. [2025-03-04 11:14:28,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 4 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-03-04 11:14:28,757 INFO L276 IsEmpty]: Start isEmpty. Operand 1470 states and 1646 transitions. [2025-03-04 11:14:28,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-04 11:14:28,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:28,760 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, 1] [2025-03-04 11:14:28,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 11:14:28,760 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:28,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1922362225, now seen corresponding path program 3 times [2025-03-04 11:14:28,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:28,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394800855] [2025-03-04 11:14:28,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:14:28,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:28,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 180 statements into 13 equivalence classes. [2025-03-04 11:14:28,772 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 180 statements. [2025-03-04 11:14:28,772 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:14:28,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:28,837 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-04 11:14:28,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:28,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394800855] [2025-03-04 11:14:28,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394800855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:14:28,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:14:28,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:14:28,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452067906] [2025-03-04 11:14:28,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:14:28,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:14:28,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:28,839 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:14:28,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:14:28,840 INFO L87 Difference]: Start difference. First operand 1470 states and 1646 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-04 11:14:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:29,017 INFO L93 Difference]: Finished difference Result 1475 states and 1650 transitions. [2025-03-04 11:14:29,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:14:29,018 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 180 [2025-03-04 11:14:29,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:29,022 INFO L225 Difference]: With dead ends: 1475 [2025-03-04 11:14:29,022 INFO L226 Difference]: Without dead ends: 1474 [2025-03-04 11:14:29,023 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-04 11:14:29,023 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 39 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:29,023 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 170 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:14:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2025-03-04 11:14:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1215. [2025-03-04 11:14:29,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1215 states, 972 states have (on average 1.1296296296296295) internal successors, (1098), 978 states have internal predecessors, (1098), 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-04 11:14:29,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1215 states to 1215 states and 1350 transitions. [2025-03-04 11:14:29,098 INFO L78 Accepts]: Start accepts. Automaton has 1215 states and 1350 transitions. Word has length 180 [2025-03-04 11:14:29,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:29,099 INFO L471 AbstractCegarLoop]: Abstraction has 1215 states and 1350 transitions. [2025-03-04 11:14:29,099 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-04 11:14:29,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1215 states and 1350 transitions. [2025-03-04 11:14:29,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 11:14:29,102 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:29,102 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, 1] [2025-03-04 11:14:29,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 11:14:29,102 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-04 11:14:29,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:29,103 INFO L85 PathProgramCache]: Analyzing trace with hash -217915863, now seen corresponding path program 1 times [2025-03-04 11:14:29,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:29,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660015243] [2025-03-04 11:14:29,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:29,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 11:14:29,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 11:14:29,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:29,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:29,875 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-04 11:14:29,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:29,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660015243] [2025-03-04 11:14:29,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660015243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:29,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432039587] [2025-03-04 11:14:29,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:29,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:29,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:29,878 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:29,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 11:14:29,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-03-04 11:14:29,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 11:14:29,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:29,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:29,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 11:14:29,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:30,145 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-04 11:14:30,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:30,981 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-04 11:14:30,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432039587] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:30,981 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:30,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 37, 38] total 77 [2025-03-04 11:14:30,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186184177] [2025-03-04 11:14:30,981 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:30,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 77 states [2025-03-04 11:14:30,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:30,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2025-03-04 11:14:30,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1207, Invalid=4645, Unknown=0, NotChecked=0, Total=5852 [2025-03-04 11:14:30,983 INFO L87 Difference]: Start difference. First operand 1215 states and 1350 transitions. Second operand has 77 states, 77 states have (on average 3.2987012987012987) internal successors, (254), 77 states have internal predecessors, (254), 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-04 11:14:33,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:33,796 INFO L93 Difference]: Finished difference Result 2635 states and 2960 transitions. [2025-03-04 11:14:33,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2025-03-04 11:14:33,796 INFO L78 Accepts]: Start accepts. Automaton has has 77 states, 77 states have (on average 3.2987012987012987) internal successors, (254), 77 states have internal predecessors, (254), 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 200 [2025-03-04 11:14:33,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:33,803 INFO L225 Difference]: With dead ends: 2635 [2025-03-04 11:14:33,803 INFO L226 Difference]: Without dead ends: 2321 [2025-03-04 11:14:33,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 362 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7243 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=5582, Invalid=20824, Unknown=0, NotChecked=0, Total=26406 [2025-03-04 11:14:33,805 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 668 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:33,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 732 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-04 11:14:33,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-03-04 11:14:33,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2111. [2025-03-04 11:14:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 1691 states have (on average 1.117090479006505) internal successors, (1889), 1697 states have internal predecessors, (1889), 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-04 11:14:33,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 2317 transitions. [2025-03-04 11:14:33,964 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 2317 transitions. Word has length 200 [2025-03-04 11:14:33,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:33,965 INFO L471 AbstractCegarLoop]: Abstraction has 2111 states and 2317 transitions. [2025-03-04 11:14:33,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 77 states, 77 states have (on average 3.2987012987012987) internal successors, (254), 77 states have internal predecessors, (254), 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-04 11:14:33,965 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 2317 transitions. [2025-03-04 11:14:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-04 11:14:33,969 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:33,969 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, 1] [2025-03-04 11:14:33,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 11:14:34,169 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-04 11:14:34,170 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:14:34,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:34,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1038109673, now seen corresponding path program 1 times [2025-03-04 11:14:34,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:34,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50101820] [2025-03-04 11:14:34,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:34,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:34,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-04 11:14:34,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-04 11:14:34,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:34,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:34,917 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-04 11:14:34,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:34,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50101820] [2025-03-04 11:14:34,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50101820] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:34,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039270402] [2025-03-04 11:14:34,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:14:34,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:34,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:34,920 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:34,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 11:14:34,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-04 11:14:34,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-04 11:14:34,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:14:34,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:34,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-04 11:14:34,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:35,972 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-04 11:14:35,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:37,390 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-04 11:14:37,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039270402] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:37,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:37,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 38, 38] total 114 [2025-03-04 11:14:37,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304922090] [2025-03-04 11:14:37,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:37,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2025-03-04 11:14:37,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:37,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2025-03-04 11:14:37,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2714, Invalid=10396, Unknown=0, NotChecked=0, Total=13110 [2025-03-04 11:14:37,394 INFO L87 Difference]: Start difference. First operand 2111 states and 2317 transitions. Second operand has 115 states, 114 states have (on average 3.008771929824561) internal successors, (343), 115 states have internal predecessors, (343), 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-04 11:14:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:44,127 INFO L93 Difference]: Finished difference Result 4045 states and 4548 transitions. [2025-03-04 11:14:44,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2025-03-04 11:14:44,128 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 114 states have (on average 3.008771929824561) internal successors, (343), 115 states have internal predecessors, (343), 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 206 [2025-03-04 11:14:44,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:44,138 INFO L225 Difference]: With dead ends: 4045 [2025-03-04 11:14:44,139 INFO L226 Difference]: Without dead ends: 3731 [2025-03-04 11:14:44,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19108 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=14924, Invalid=57706, Unknown=0, NotChecked=0, Total=72630 [2025-03-04 11:14:44,145 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1278 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 974 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1278 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:44,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1278 Valid, 651 Invalid, 1110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 974 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 11:14:44,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3731 states. [2025-03-04 11:14:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3731 to 2383. [2025-03-04 11:14:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 1909 states have (on average 1.1210057621791514) internal successors, (2140), 1916 states have internal predecessors, (2140), 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-04 11:14:44,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 2622 transitions. [2025-03-04 11:14:44,310 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 2622 transitions. Word has length 206 [2025-03-04 11:14:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:44,311 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 2622 transitions. [2025-03-04 11:14:44,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 114 states have (on average 3.008771929824561) internal successors, (343), 115 states have internal predecessors, (343), 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-04 11:14:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 2622 transitions. [2025-03-04 11:14:44,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2025-03-04 11:14:44,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:44,315 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, 1] [2025-03-04 11:14:44,324 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-04 11:14:44,520 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-04 11:14:44,520 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-04 11:14:44,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:44,522 INFO L85 PathProgramCache]: Analyzing trace with hash -272326509, now seen corresponding path program 2 times [2025-03-04 11:14:44,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:44,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556883332] [2025-03-04 11:14:44,522 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:44,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:44,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 260 statements into 2 equivalence classes. [2025-03-04 11:14:44,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 260 of 260 statements. [2025-03-04 11:14:44,563 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:44,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:45,699 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-04 11:14:45,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556883332] [2025-03-04 11:14:45,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556883332] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:45,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355297620] [2025-03-04 11:14:45,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:45,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:45,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:45,705 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:45,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 11:14:45,745 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 260 statements into 2 equivalence classes. [2025-03-04 11:14:45,796 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 260 of 260 statements. [2025-03-04 11:14:45,797 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:45,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:45,799 INFO L256 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 11:14:45,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:46,004 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-04 11:14:46,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:47,330 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-04 11:14:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355297620] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:47,330 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:47,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 50] total 101 [2025-03-04 11:14:47,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99151749] [2025-03-04 11:14:47,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:47,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 101 states [2025-03-04 11:14:47,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:47,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2025-03-04 11:14:47,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2095, Invalid=8005, Unknown=0, NotChecked=0, Total=10100 [2025-03-04 11:14:47,333 INFO L87 Difference]: Start difference. First operand 2383 states and 2622 transitions. Second operand has 101 states, 101 states have (on average 3.287128712871287) internal successors, (332), 101 states have internal predecessors, (332), 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-04 11:14:52,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:14:52,044 INFO L93 Difference]: Finished difference Result 4221 states and 4722 transitions. [2025-03-04 11:14:52,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2025-03-04 11:14:52,045 INFO L78 Accepts]: Start accepts. Automaton has has 101 states, 101 states have (on average 3.287128712871287) internal successors, (332), 101 states have internal predecessors, (332), 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 260 [2025-03-04 11:14:52,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:14:52,056 INFO L225 Difference]: With dead ends: 4221 [2025-03-04 11:14:52,056 INFO L226 Difference]: Without dead ends: 3814 [2025-03-04 11:14:52,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 470 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-04 11:14:52,062 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1042 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:14:52,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 676 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 11:14:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3814 states. [2025-03-04 11:14:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3814 to 3115. [2025-03-04 11:14:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3115 states, 2493 states have (on average 1.1211391897312475) internal successors, (2795), 2500 states have internal predecessors, (2795), 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-04 11:14:52,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3115 states to 3115 states and 3425 transitions. [2025-03-04 11:14:52,242 INFO L78 Accepts]: Start accepts. Automaton has 3115 states and 3425 transitions. Word has length 260 [2025-03-04 11:14:52,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:14:52,243 INFO L471 AbstractCegarLoop]: Abstraction has 3115 states and 3425 transitions. [2025-03-04 11:14:52,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 101 states, 101 states have (on average 3.287128712871287) internal successors, (332), 101 states have internal predecessors, (332), 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-04 11:14:52,244 INFO L276 IsEmpty]: Start isEmpty. Operand 3115 states and 3425 transitions. [2025-03-04 11:14:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-04 11:14:52,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:14:52,258 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, 1] [2025-03-04 11:14:52,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-04 11:14:52,458 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-04 11:14:52,459 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-04 11:14:52,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:14:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1600493588, now seen corresponding path program 2 times [2025-03-04 11:14:52,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:14:52,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684193656] [2025-03-04 11:14:52,459 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:52,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:14:52,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 274 statements into 2 equivalence classes. [2025-03-04 11:14:52,505 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 274 of 274 statements. [2025-03-04 11:14:52,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:52,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:53,913 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-04 11:14:53,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:14:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684193656] [2025-03-04 11:14:53,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684193656] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:14:53,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468929697] [2025-03-04 11:14:53,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:14:53,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:14:53,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:14:53,915 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:14:53,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 11:14:53,955 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 274 statements into 2 equivalence classes. [2025-03-04 11:14:54,011 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 274 of 274 statements. [2025-03-04 11:14:54,012 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 11:14:54,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:14:54,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 11:14:54,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:14:54,294 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-04 11:14:54,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:14:55,809 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-04 11:14:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468929697] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:14:55,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:14:55,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 51, 52] total 105 [2025-03-04 11:14:55,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476789886] [2025-03-04 11:14:55,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:14:55,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 105 states [2025-03-04 11:14:55,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:14:55,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2025-03-04 11:14:55,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=2341, Invalid=8579, Unknown=0, NotChecked=0, Total=10920 [2025-03-04 11:14:55,813 INFO L87 Difference]: Start difference. First operand 3115 states and 3425 transitions. Second operand has 105 states, 105 states have (on average 3.323809523809524) internal successors, (349), 105 states have internal predecessors, (349), 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-04 11:15:00,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:00,362 INFO L93 Difference]: Finished difference Result 5362 states and 5950 transitions. [2025-03-04 11:15:00,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2025-03-04 11:15:00,363 INFO L78 Accepts]: Start accepts. Automaton has has 105 states, 105 states have (on average 3.323809523809524) internal successors, (349), 105 states have internal predecessors, (349), 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 274 [2025-03-04 11:15:00,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:00,376 INFO L225 Difference]: With dead ends: 5362 [2025-03-04 11:15:00,376 INFO L226 Difference]: Without dead ends: 4955 [2025-03-04 11:15:00,380 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14110 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=11487, Invalid=39815, Unknown=0, NotChecked=0, Total=51302 [2025-03-04 11:15:00,381 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1292 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1292 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:00,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1292 Valid, 707 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-04 11:15:00,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4955 states. [2025-03-04 11:15:00,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4955 to 4548. [2025-03-04 11:15:00,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4548 states, 3642 states have (on average 1.1169686985172982) internal successors, (4068), 3648 states have internal predecessors, (4068), 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-04 11:15:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4548 states to 4548 states and 4982 transitions. [2025-03-04 11:15:00,629 INFO L78 Accepts]: Start accepts. Automaton has 4548 states and 4982 transitions. Word has length 274 [2025-03-04 11:15:00,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:00,629 INFO L471 AbstractCegarLoop]: Abstraction has 4548 states and 4982 transitions. [2025-03-04 11:15:00,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 105 states, 105 states have (on average 3.323809523809524) internal successors, (349), 105 states have internal predecessors, (349), 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-04 11:15:00,630 INFO L276 IsEmpty]: Start isEmpty. Operand 4548 states and 4982 transitions. [2025-03-04 11:15:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2025-03-04 11:15:00,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:00,659 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, 1] [2025-03-04 11:15:00,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-04 11:15:00,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 11:15:00,859 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-04 11:15:00,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:00,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1283189850, now seen corresponding path program 3 times [2025-03-04 11:15:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:00,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478745916] [2025-03-04 11:15:00,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:15:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:00,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 280 statements into 20 equivalence classes. [2025-03-04 11:15:00,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 55 of 280 statements. [2025-03-04 11:15:00,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:15:00,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:00,928 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-04 11:15:00,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:00,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478745916] [2025-03-04 11:15:00,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478745916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:15:00,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:15:00,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 11:15:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621120851] [2025-03-04 11:15:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:15:00,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:15:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:00,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:15:00,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:15:00,930 INFO L87 Difference]: Start difference. First operand 4548 states and 4982 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 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-04 11:15:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:01,277 INFO L93 Difference]: Finished difference Result 4586 states and 5020 transitions. [2025-03-04 11:15:01,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:15:01,278 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 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 280 [2025-03-04 11:15:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:01,290 INFO L225 Difference]: With dead ends: 4586 [2025-03-04 11:15:01,291 INFO L226 Difference]: Without dead ends: 4584 [2025-03-04 11:15:01,292 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-04 11:15:01,293 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 33 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:01,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 190 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:15:01,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2025-03-04 11:15:01,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4536. [2025-03-04 11:15:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4536 states, 3631 states have (on average 1.1162214266042412) internal successors, (4053), 3637 states have internal predecessors, (4053), 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-04 11:15:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4536 states to 4536 states and 4965 transitions. [2025-03-04 11:15:01,541 INFO L78 Accepts]: Start accepts. Automaton has 4536 states and 4965 transitions. Word has length 280 [2025-03-04 11:15:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:01,541 INFO L471 AbstractCegarLoop]: Abstraction has 4536 states and 4965 transitions. [2025-03-04 11:15:01,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 8 states have internal predecessors, (36), 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-04 11:15:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand 4536 states and 4965 transitions. [2025-03-04 11:15:01,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2025-03-04 11:15:01,546 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:15:01,546 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, 1] [2025-03-04 11:15:01,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 11:15:01,547 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 11:15:01,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:15:01,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1458774707, now seen corresponding path program 3 times [2025-03-04 11:15:01,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:15:01,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24602018] [2025-03-04 11:15:01,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:15:01,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:15:01,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 284 statements into 20 equivalence classes. [2025-03-04 11:15:01,560 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 59 of 284 statements. [2025-03-04 11:15:01,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:15:01,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:01,626 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-04 11:15:01,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:15:01,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24602018] [2025-03-04 11:15:01,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24602018] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:15:01,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461663317] [2025-03-04 11:15:01,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 11:15:01,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:01,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:15:01,629 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:15:01,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 11:15:01,664 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 284 statements into 20 equivalence classes. [2025-03-04 11:15:01,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 59 of 284 statements. [2025-03-04 11:15:01,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 11:15:01,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:15:01,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 11:15:01,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:15:01,704 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-04 11:15:01,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:15:01,816 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-04 11:15:01,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [461663317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:15:01,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:15:01,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 17 [2025-03-04 11:15:01,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980133629] [2025-03-04 11:15:01,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:15:01,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 11:15:01,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:15:01,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 11:15:01,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2025-03-04 11:15:01,818 INFO L87 Difference]: Start difference. First operand 4536 states and 4965 transitions. Second operand has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 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-04 11:15:02,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:15:02,396 INFO L93 Difference]: Finished difference Result 4630 states and 5074 transitions. [2025-03-04 11:15:02,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:15:02,396 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 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 284 [2025-03-04 11:15:02,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:15:02,403 INFO L225 Difference]: With dead ends: 4630 [2025-03-04 11:15:02,404 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:15:02,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 559 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-04 11:15:02,410 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 78 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:15:02,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 259 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:15:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:15:02,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:15:02,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 11:15:02,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:15:02,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 284 [2025-03-04 11:15:02,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:15:02,413 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:15:02,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.588235294117647) internal successors, (61), 18 states have internal predecessors, (61), 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-04 11:15:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:15:02,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:15:02,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2025-03-04 11:15:02,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2025-03-04 11:15:02,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2025-03-04 11:15:02,415 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2025-03-04 11:15:02,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2025-03-04 11:15:02,416 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2025-03-04 11:15:02,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-04 11:15:02,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:15:02,622 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, 1] [2025-03-04 11:15:02,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.