./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.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/cohencu-ll_unwindbound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:52:53,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:52:53,148 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:52:53,152 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:52:53,153 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:52:53,176 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:52:53,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:52:53,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:52:53,177 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:52:53,177 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:52:53,177 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:52:53,177 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:52:53,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:52:53,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:52:53,178 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:52:53,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:52:53,178 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:52:53,178 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:52:53,178 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:52:53,178 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:52:53,178 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:52:53,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:52:53,179 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:52:53,179 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:52:53,179 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:52:53,179 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:52:53,179 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:52:53,179 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:52:53,179 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:52:53,179 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:52:53,179 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:52:53,180 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:52:53,180 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:52:53,180 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:52:53,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:52:53,180 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:52:53,180 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:52:53,180 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:52:53,180 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:52:53,180 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:52:53,181 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:52:53,181 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:52:53,181 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:52:53,181 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:52:53,181 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:52:53,181 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 -> f50c7bc2857aa84cb02200a831151d15e1603828dabc8b6cfed5e5d60ae2ee71 [2025-03-04 10:52:53,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:52:53,398 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:52:53,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:52:53,401 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:52:53,401 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:52:53,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2025-03-04 10:52:54,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1268ab2e/9c33acfe1ba949349c59241d1ae57b09/FLAG523419a02 [2025-03-04 10:52:54,716 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:52:54,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/cohencu-ll_unwindbound2.c [2025-03-04 10:52:54,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1268ab2e/9c33acfe1ba949349c59241d1ae57b09/FLAG523419a02 [2025-03-04 10:52:55,091 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1268ab2e/9c33acfe1ba949349c59241d1ae57b09 [2025-03-04 10:52:55,093 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:52:55,094 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:52:55,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:52:55,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:52:55,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:52:55,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,101 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f9fcaa6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55, skipping insertion in model container [2025-03-04 10:52:55,101 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:52:55,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:52:55,224 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:52:55,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:52:55,251 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:52:55,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55 WrapperNode [2025-03-04 10:52:55,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:52:55,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:52:55,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:52:55,252 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:52:55,257 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,264 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,290 INFO L138 Inliner]: procedures = 14, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 194 [2025-03-04 10:52:55,294 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:52:55,294 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:52:55,294 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:52:55,295 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:52:55,300 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,301 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,311 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 10:52:55,312 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,312 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,314 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,314 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,317 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,318 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:52:55,319 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:52:55,319 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:52:55,319 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:52:55,323 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (1/1) ... [2025-03-04 10:52:55,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:52:55,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:55,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:52:55,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:52:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:52:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:52:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:52:55,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:52:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-04 10:52:55,366 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-04 10:52:55,400 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:52:55,401 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:52:55,956 INFO L? ?]: Removed 239 outVars from TransFormulas that were not future-live. [2025-03-04 10:52:55,956 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:52:55,972 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:52:55,973 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:52:55,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:52:55 BoogieIcfgContainer [2025-03-04 10:52:55,973 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:52:55,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:52:55,974 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:52:55,979 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:52:55,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:52:55" (1/3) ... [2025-03-04 10:52:55,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52676d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:52:55, skipping insertion in model container [2025-03-04 10:52:55,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:52:55" (2/3) ... [2025-03-04 10:52:55,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52676d68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:52:55, skipping insertion in model container [2025-03-04 10:52:55,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:52:55" (3/3) ... [2025-03-04 10:52:55,981 INFO L128 eAbstractionObserver]: Analyzing ICFG cohencu-ll_unwindbound2.c [2025-03-04 10:52:55,991 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:52:55,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cohencu-ll_unwindbound2.c that has 2 procedures, 306 locations, 1 initial locations, 1 loop locations, and 140 error locations. [2025-03-04 10:52:56,036 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:52:56,045 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;@21ed1835, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:52:56,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 140 error locations. [2025-03-04 10:52:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand has 306 states, 153 states have (on average 1.9411764705882353) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 10:52:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 10:52:56,053 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:56,053 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 10:52:56,054 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:52:56,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:56,057 INFO L85 PathProgramCache]: Analyzing trace with hash 10188447, now seen corresponding path program 1 times [2025-03-04 10:52:56,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:56,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360997020] [2025-03-04 10:52:56,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:56,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:56,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:52:56,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:52:56,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:56,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:56,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:52:56,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:56,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360997020] [2025-03-04 10:52:56,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360997020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:56,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:56,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:52:56,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017962505] [2025-03-04 10:52:56,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:56,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:52:56,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:56,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:52:56,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:56,220 INFO L87 Difference]: Start difference. First operand has 306 states, 153 states have (on average 1.9411764705882353) internal successors, (297), 293 states have internal predecessors, (297), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:52:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:56,302 INFO L93 Difference]: Finished difference Result 606 states and 654 transitions. [2025-03-04 10:52:56,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:52:56,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 10:52:56,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:56,308 INFO L225 Difference]: With dead ends: 606 [2025-03-04 10:52:56,308 INFO L226 Difference]: Without dead ends: 296 [2025-03-04 10:52:56,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:52:56,312 INFO L435 NwaCegarLoop]: 305 mSDtfsCounter, 4 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:56,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 909 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:52:56,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-03-04 10:52:56,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2025-03-04 10:52:56,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 152 states have (on average 1.881578947368421) internal successors, (286), 284 states have internal predecessors, (286), 10 states have call successors, (10), 1 states have call predecessors, (10), 1 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2025-03-04 10:52:56,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 306 transitions. [2025-03-04 10:52:56,346 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 306 transitions. Word has length 4 [2025-03-04 10:52:56,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:56,347 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 306 transitions. [2025-03-04 10:52:56,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:52:56,347 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 306 transitions. [2025-03-04 10:52:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 10:52:56,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:56,348 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:56,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:52:56,348 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:52:56,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:56,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1418391353, now seen corresponding path program 1 times [2025-03-04 10:52:56,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:56,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166278910] [2025-03-04 10:52:56,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:56,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:56,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 10:52:56,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 10:52:56,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:56,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:56,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:52:56,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:56,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166278910] [2025-03-04 10:52:56,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166278910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:56,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:56,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:52:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263806133] [2025-03-04 10:52:56,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:56,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:52:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:56,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:52:56,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:52:56,408 INFO L87 Difference]: Start difference. First operand 296 states and 306 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:52:56,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:56,529 INFO L93 Difference]: Finished difference Result 564 states and 584 transitions. [2025-03-04 10:52:56,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:52:56,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-04 10:52:56,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:56,532 INFO L225 Difference]: With dead ends: 564 [2025-03-04 10:52:56,533 INFO L226 Difference]: Without dead ends: 544 [2025-03-04 10:52:56,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:52:56,535 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 237 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:56,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 581 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:52:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2025-03-04 10:52:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 354. [2025-03-04 10:52:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 205 states have (on average 1.7902439024390244) internal successors, (367), 337 states have internal predecessors, (367), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:52:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 397 transitions. [2025-03-04 10:52:56,560 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 397 transitions. Word has length 7 [2025-03-04 10:52:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:56,560 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 397 transitions. [2025-03-04 10:52:56,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:52:56,560 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 397 transitions. [2025-03-04 10:52:56,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 10:52:56,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:56,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:56,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:52:56,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:52:56,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:56,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1941662720, now seen corresponding path program 1 times [2025-03-04 10:52:56,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:56,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-04 10:52:56,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:56,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:56,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:52:56,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:52:56,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:56,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:56,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1778307090] [2025-03-04 10:52:56,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:56,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:56,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:56,587 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:56,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:52:56,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 10:52:56,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 10:52:56,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:56,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:56,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:52:56,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:56,771 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:52:56,772 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:52:56,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465913524] [2025-03-04 10:52:56,773 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:56,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778307090] [2025-03-04 10:52:56,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778307090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:56,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:56,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:52:56,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403700891] [2025-03-04 10:52:56,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:56,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:52:56,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:56,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:52:56,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:52:56,776 INFO L87 Difference]: Start difference. First operand 354 states and 397 transitions. Second operand has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:57,198 INFO L93 Difference]: Finished difference Result 514 states and 572 transitions. [2025-03-04 10:52:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:52:57,198 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2025-03-04 10:52:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:57,200 INFO L225 Difference]: With dead ends: 514 [2025-03-04 10:52:57,200 INFO L226 Difference]: Without dead ends: 459 [2025-03-04 10:52:57,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:52:57,201 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 134 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:57,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 371 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:52:57,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2025-03-04 10:52:57,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 439. [2025-03-04 10:52:57,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.6491228070175439) internal successors, (470), 417 states have internal predecessors, (470), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:52:57,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 510 transitions. [2025-03-04 10:52:57,221 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 510 transitions. Word has length 40 [2025-03-04 10:52:57,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:57,222 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 510 transitions. [2025-03-04 10:52:57,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 510 transitions. [2025-03-04 10:52:57,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:52:57,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:57,222 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:57,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:52:57,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:57,423 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:52:57,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1922060450, now seen corresponding path program 1 times [2025-03-04 10:52:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:57,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563583361] [2025-03-04 10:52:57,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:57,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:57,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:52:57,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:52:57,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:57,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:52:57,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:57,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563583361] [2025-03-04 10:52:57,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563583361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:57,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:57,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:52:57,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465637524] [2025-03-04 10:52:57,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:57,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:52:57,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:57,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:52:57,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:52:57,506 INFO L87 Difference]: Start difference. First operand 439 states and 510 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:57,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:57,766 INFO L93 Difference]: Finished difference Result 472 states and 517 transitions. [2025-03-04 10:52:57,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:52:57,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2025-03-04 10:52:57,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:57,768 INFO L225 Difference]: With dead ends: 472 [2025-03-04 10:52:57,770 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 10:52:57,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:52:57,771 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 120 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:57,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 487 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:52:57,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 10:52:57,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-04 10:52:57,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.568421052631579) internal successors, (447), 417 states have internal predecessors, (447), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:52:57,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 487 transitions. [2025-03-04 10:52:57,793 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 487 transitions. Word has length 42 [2025-03-04 10:52:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:57,793 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 487 transitions. [2025-03-04 10:52:57,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 487 transitions. [2025-03-04 10:52:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:52:57,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:57,795 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:57,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:52:57,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:52:57,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:57,795 INFO L85 PathProgramCache]: Analyzing trace with hash -264148292, now seen corresponding path program 1 times [2025-03-04 10:52:57,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:57,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118987624] [2025-03-04 10:52:57,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:57,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:57,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:52:57,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:52:57,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:57,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:57,865 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:52:57,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:57,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118987624] [2025-03-04 10:52:57,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118987624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:57,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:57,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:52:57,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146258668] [2025-03-04 10:52:57,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:57,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:52:57,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:57,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:52:57,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:57,867 INFO L87 Difference]: Start difference. First operand 439 states and 487 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:58,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:58,393 INFO L93 Difference]: Finished difference Result 451 states and 494 transitions. [2025-03-04 10:52:58,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:52:58,393 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2025-03-04 10:52:58,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:58,395 INFO L225 Difference]: With dead ends: 451 [2025-03-04 10:52:58,396 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 10:52:58,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:58,396 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 140 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:58,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 528 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:52:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 10:52:58,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-04 10:52:58,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.5614035087719298) internal successors, (445), 417 states have internal predecessors, (445), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:52:58,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 485 transitions. [2025-03-04 10:52:58,405 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 485 transitions. Word has length 44 [2025-03-04 10:52:58,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:58,406 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 485 transitions. [2025-03-04 10:52:58,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:58,406 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 485 transitions. [2025-03-04 10:52:58,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 10:52:58,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:58,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:58,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:52:58,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:52:58,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:58,407 INFO L85 PathProgramCache]: Analyzing trace with hash 401337751, now seen corresponding path program 1 times [2025-03-04 10:52:58,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:58,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361650188] [2025-03-04 10:52:58,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:58,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:58,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:52:58,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:52:58,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:58,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:58,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:52:58,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:58,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361650188] [2025-03-04 10:52:58,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361650188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:58,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:58,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:52:58,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474007598] [2025-03-04 10:52:58,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:58,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:52:58,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:58,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:52:58,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:58,475 INFO L87 Difference]: Start difference. First operand 439 states and 485 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:58,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:58,787 INFO L93 Difference]: Finished difference Result 451 states and 492 transitions. [2025-03-04 10:52:58,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:52:58,788 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2025-03-04 10:52:58,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:58,790 INFO L225 Difference]: With dead ends: 451 [2025-03-04 10:52:58,792 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 10:52:58,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:58,793 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 255 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:58,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 452 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 10:52:58,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 439. [2025-03-04 10:52:58,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 285 states have (on average 1.5543859649122806) internal successors, (443), 417 states have internal predecessors, (443), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:52:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 483 transitions. [2025-03-04 10:52:58,812 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 483 transitions. Word has length 45 [2025-03-04 10:52:58,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:58,812 INFO L471 AbstractCegarLoop]: Abstraction has 439 states and 483 transitions. [2025-03-04 10:52:58,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:58,813 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 483 transitions. [2025-03-04 10:52:58,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 10:52:58,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:58,813 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:58,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:52:58,814 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:52:58,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:58,814 INFO L85 PathProgramCache]: Analyzing trace with hash -935804552, now seen corresponding path program 1 times [2025-03-04 10:52:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:58,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717594152] [2025-03-04 10:52:58,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:58,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:58,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:52:58,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:52:58,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:58,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:52:58,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1982806686] [2025-03-04 10:52:58,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:58,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:52:58,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:52:58,827 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:52:58,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:52:58,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 10:52:58,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 10:52:58,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:58,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:58,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:52:58,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:52:59,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:52:59,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:52:59,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717594152] [2025-03-04 10:52:59,039 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:52:59,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1982806686] [2025-03-04 10:52:59,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1982806686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:59,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:59,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:52:59,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336683039] [2025-03-04 10:52:59,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:59,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:52:59,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:59,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:52:59,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:52:59,040 INFO L87 Difference]: Start difference. First operand 439 states and 483 transitions. Second operand has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:59,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:59,334 INFO L93 Difference]: Finished difference Result 456 states and 490 transitions. [2025-03-04 10:52:59,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:52:59,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 48 [2025-03-04 10:52:59,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:59,336 INFO L225 Difference]: With dead ends: 456 [2025-03-04 10:52:59,336 INFO L226 Difference]: Without dead ends: 447 [2025-03-04 10:52:59,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:52:59,337 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 112 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:59,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 283 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-04 10:52:59,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 442. [2025-03-04 10:52:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 288 states have (on average 1.5277777777777777) internal successors, (440), 420 states have internal predecessors, (440), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:52:59,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 480 transitions. [2025-03-04 10:52:59,351 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 480 transitions. Word has length 48 [2025-03-04 10:52:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:52:59,351 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 480 transitions. [2025-03-04 10:52:59,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 480 transitions. [2025-03-04 10:52:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-04 10:52:59,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:52:59,352 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:52:59,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:52:59,552 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 10:52:59,552 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:52:59,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:52:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1054830163, now seen corresponding path program 1 times [2025-03-04 10:52:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:52:59,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446833232] [2025-03-04 10:52:59,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:52:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:52:59,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 10:52:59,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 10:52:59,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:52:59,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:52:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:52:59,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:52:59,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446833232] [2025-03-04 10:52:59,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446833232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:52:59,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:52:59,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:52:59,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136873959] [2025-03-04 10:52:59,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:52:59,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:52:59,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:52:59,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:52:59,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:59,637 INFO L87 Difference]: Start difference. First operand 442 states and 480 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:52:59,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:52:59,989 INFO L93 Difference]: Finished difference Result 455 states and 481 transitions. [2025-03-04 10:52:59,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:52:59,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 49 [2025-03-04 10:52:59,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:52:59,991 INFO L225 Difference]: With dead ends: 455 [2025-03-04 10:52:59,991 INFO L226 Difference]: Without dead ends: 449 [2025-03-04 10:52:59,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:52:59,991 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 136 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:52:59,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 417 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:52:59,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-04 10:52:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 442. [2025-03-04 10:52:59,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 288 states have (on average 1.5069444444444444) internal successors, (434), 420 states have internal predecessors, (434), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 10:53:00,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 474 transitions. [2025-03-04 10:53:00,001 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 474 transitions. Word has length 49 [2025-03-04 10:53:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:00,001 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 474 transitions. [2025-03-04 10:53:00,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 474 transitions. [2025-03-04 10:53:00,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-04 10:53:00,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:00,001 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:00,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:53:00,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:00,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:00,002 INFO L85 PathProgramCache]: Analyzing trace with hash -899125489, now seen corresponding path program 1 times [2025-03-04 10:53:00,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:00,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443360164] [2025-03-04 10:53:00,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:00,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:00,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 10:53:00,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 10:53:00,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:00,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:00,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 10:53:00,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:00,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443360164] [2025-03-04 10:53:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443360164] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:00,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:00,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:00,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863475472] [2025-03-04 10:53:00,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:00,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:00,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:00,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:00,120 INFO L87 Difference]: Start difference. First operand 442 states and 474 transitions. Second operand has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:00,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:00,556 INFO L93 Difference]: Finished difference Result 453 states and 475 transitions. [2025-03-04 10:53:00,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:00,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2025-03-04 10:53:00,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:00,558 INFO L225 Difference]: With dead ends: 453 [2025-03-04 10:53:00,558 INFO L226 Difference]: Without dead ends: 380 [2025-03-04 10:53:00,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:00,559 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 119 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:00,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 433 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:00,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-04 10:53:00,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 376. [2025-03-04 10:53:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 225 states have (on average 1.6222222222222222) internal successors, (365), 357 states have internal predecessors, (365), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 399 transitions. [2025-03-04 10:53:00,572 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 399 transitions. Word has length 53 [2025-03-04 10:53:00,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:00,573 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 399 transitions. [2025-03-04 10:53:00,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 13.666666666666666) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 10:53:00,573 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 399 transitions. [2025-03-04 10:53:00,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-03-04 10:53:00,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:00,575 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:00,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 10:53:00,575 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:00,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:00,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1828896756, now seen corresponding path program 1 times [2025-03-04 10:53:00,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:00,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-03-04 10:53:00,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:00,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:00,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 10:53:00,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 10:53:00,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:00,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:00,648 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:00,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:00,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146685224] [2025-03-04 10:53:00,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146685224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:00,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:00,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:00,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049452871] [2025-03-04 10:53:00,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:00,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:00,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:00,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:00,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:00,650 INFO L87 Difference]: Start difference. First operand 376 states and 399 transitions. Second operand has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:00,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:00,835 INFO L93 Difference]: Finished difference Result 376 states and 399 transitions. [2025-03-04 10:53:00,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:00,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 85 [2025-03-04 10:53:00,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:00,837 INFO L225 Difference]: With dead ends: 376 [2025-03-04 10:53:00,837 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 10:53:00,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:00,838 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 141 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:00,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 159 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:00,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 10:53:00,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-04 10:53:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 225 states have (on average 1.5911111111111111) internal successors, (358), 350 states have internal predecessors, (358), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:00,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 392 transitions. [2025-03-04 10:53:00,848 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 392 transitions. Word has length 85 [2025-03-04 10:53:00,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:00,848 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 392 transitions. [2025-03-04 10:53:00,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 31.5) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:00,848 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 392 transitions. [2025-03-04 10:53:00,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-04 10:53:00,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:00,849 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:00,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 10:53:00,849 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:00,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:00,850 INFO L85 PathProgramCache]: Analyzing trace with hash -861224441, now seen corresponding path program 1 times [2025-03-04 10:53:00,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:00,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-03-04 10:53:00,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:00,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:00,856 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-04 10:53:00,863 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-04 10:53:00,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:00,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:00,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:00,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447792565] [2025-03-04 10:53:00,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447792565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:00,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:00,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992369199] [2025-03-04 10:53:00,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:00,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:00,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:00,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:00,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:00,925 INFO L87 Difference]: Start difference. First operand 369 states and 392 transitions. Second operand has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:01,120 INFO L93 Difference]: Finished difference Result 376 states and 395 transitions. [2025-03-04 10:53:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:01,121 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 86 [2025-03-04 10:53:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:01,122 INFO L225 Difference]: With dead ends: 376 [2025-03-04 10:53:01,122 INFO L226 Difference]: Without dead ends: 375 [2025-03-04 10:53:01,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:01,123 INFO L435 NwaCegarLoop]: 283 mSDtfsCounter, 24 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:01,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 428 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:01,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-04 10:53:01,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 371. [2025-03-04 10:53:01,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 227 states have (on average 1.5859030837004404) internal successors, (360), 352 states have internal predecessors, (360), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:01,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 394 transitions. [2025-03-04 10:53:01,133 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 394 transitions. Word has length 86 [2025-03-04 10:53:01,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:01,134 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 394 transitions. [2025-03-04 10:53:01,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 32.0) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:01,134 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 394 transitions. [2025-03-04 10:53:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 10:53:01,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:01,135 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:01,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 10:53:01,135 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:01,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:01,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1376228870, now seen corresponding path program 1 times [2025-03-04 10:53:01,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:01,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-04 10:53:01,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:01,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:53:01,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:53:01,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:01,203 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:01,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:01,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109224028] [2025-03-04 10:53:01,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109224028] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:01,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:01,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:01,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457681826] [2025-03-04 10:53:01,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:01,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:01,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:01,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:01,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:01,204 INFO L87 Difference]: Start difference. First operand 371 states and 394 transitions. Second operand has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:01,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:01,277 INFO L93 Difference]: Finished difference Result 371 states and 394 transitions. [2025-03-04 10:53:01,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:01,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 88 [2025-03-04 10:53:01,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:01,279 INFO L225 Difference]: With dead ends: 371 [2025-03-04 10:53:01,279 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 10:53:01,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:01,279 INFO L435 NwaCegarLoop]: 253 mSDtfsCounter, 195 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:01,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 267 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:01,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 10:53:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2025-03-04 10:53:01,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 227 states have (on average 1.5682819383259912) internal successors, (356), 350 states have internal predecessors, (356), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:01,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 390 transitions. [2025-03-04 10:53:01,289 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 390 transitions. Word has length 88 [2025-03-04 10:53:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:01,289 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 390 transitions. [2025-03-04 10:53:01,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 30.5) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 10:53:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 390 transitions. [2025-03-04 10:53:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 10:53:01,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:01,290 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:01,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 10:53:01,290 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:01,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:01,290 INFO L85 PathProgramCache]: Analyzing trace with hash -286577856, now seen corresponding path program 1 times [2025-03-04 10:53:01,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:01,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417325775] [2025-03-04 10:53:01,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:01,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 10:53:01,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 10:53:01,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:01,375 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:01,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:01,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417325775] [2025-03-04 10:53:01,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417325775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:01,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:01,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:53:01,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163986276] [2025-03-04 10:53:01,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:01,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:01,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:01,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:01,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:01,376 INFO L87 Difference]: Start difference. First operand 369 states and 390 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:01,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:01,524 INFO L93 Difference]: Finished difference Result 373 states and 390 transitions. [2025-03-04 10:53:01,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:01,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 89 [2025-03-04 10:53:01,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:01,526 INFO L225 Difference]: With dead ends: 373 [2025-03-04 10:53:01,526 INFO L226 Difference]: Without dead ends: 369 [2025-03-04 10:53:01,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:01,527 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 48 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:01,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 738 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:01,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2025-03-04 10:53:01,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 367. [2025-03-04 10:53:01,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 225 states have (on average 1.5644444444444445) internal successors, (352), 348 states have internal predecessors, (352), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:01,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 386 transitions. [2025-03-04 10:53:01,537 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 386 transitions. Word has length 89 [2025-03-04 10:53:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:01,537 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 386 transitions. [2025-03-04 10:53:01,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-04 10:53:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 386 transitions. [2025-03-04 10:53:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-04 10:53:01,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:01,538 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:01,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:53:01,538 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:01,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:01,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1292008901, now seen corresponding path program 1 times [2025-03-04 10:53:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:01,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4487649] [2025-03-04 10:53:01,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:01,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:53:01,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:53:01,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:01,643 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:01,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:01,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4487649] [2025-03-04 10:53:01,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4487649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:01,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802231450] [2025-03-04 10:53:01,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:01,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:01,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:01,645 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:01,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:53:01,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 10:53:01,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 10:53:01,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:01,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:01,699 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:01,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:01,812 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:01,813 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:01,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802231450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:01,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:01,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 10:53:01,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932029002] [2025-03-04 10:53:01,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:01,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:01,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:01,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:01,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:01,814 INFO L87 Difference]: Start difference. First operand 367 states and 386 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:01,837 INFO L93 Difference]: Finished difference Result 367 states and 386 transitions. [2025-03-04 10:53:01,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:01,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 88 [2025-03-04 10:53:01,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:01,838 INFO L225 Difference]: With dead ends: 367 [2025-03-04 10:53:01,838 INFO L226 Difference]: Without dead ends: 366 [2025-03-04 10:53:01,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:01,839 INFO L435 NwaCegarLoop]: 286 mSDtfsCounter, 223 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:01,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 856 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:53:01,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-04 10:53:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-03-04 10:53:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 225 states have (on average 1.56) internal successors, (351), 347 states have internal predecessors, (351), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-03-04 10:53:01,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 385 transitions. [2025-03-04 10:53:01,847 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 385 transitions. Word has length 88 [2025-03-04 10:53:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:01,847 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 385 transitions. [2025-03-04 10:53:01,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:01,847 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 385 transitions. [2025-03-04 10:53:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2025-03-04 10:53:01,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:01,848 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:01,855 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 10:53:02,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:02,049 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:02,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:02,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1397570531, now seen corresponding path program 1 times [2025-03-04 10:53:02,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:02,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875867155] [2025-03-04 10:53:02,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:02,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:02,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 10:53:02,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 10:53:02,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:02,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:02,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:02,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875867155] [2025-03-04 10:53:02,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875867155] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:02,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675782744] [2025-03-04 10:53:02,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:02,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:02,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:02,135 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:02,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:53:02,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-04 10:53:02,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-04 10:53:02,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:02,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:02,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:02,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:02,259 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:02,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:02,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675782744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:02,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:02,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2025-03-04 10:53:02,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953154198] [2025-03-04 10:53:02,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:02,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:02,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:02,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:02,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:02,261 INFO L87 Difference]: Start difference. First operand 366 states and 385 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:02,324 INFO L93 Difference]: Finished difference Result 535 states and 557 transitions. [2025-03-04 10:53:02,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:02,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 89 [2025-03-04 10:53:02,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:02,326 INFO L225 Difference]: With dead ends: 535 [2025-03-04 10:53:02,326 INFO L226 Difference]: Without dead ends: 534 [2025-03-04 10:53:02,326 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:02,327 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 221 mSDsluCounter, 1049 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:02,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1499 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:53:02,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-04 10:53:02,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 442. [2025-03-04 10:53:02,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 296 states have (on average 1.6283783783783783) internal successors, (482), 418 states have internal predecessors, (482), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 10:53:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 526 transitions. [2025-03-04 10:53:02,340 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 526 transitions. Word has length 89 [2025-03-04 10:53:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:02,340 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 526 transitions. [2025-03-04 10:53:02,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:02,340 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 526 transitions. [2025-03-04 10:53:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-03-04 10:53:02,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:02,341 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:02,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:53:02,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:53:02,542 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:02,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1259474975, now seen corresponding path program 1 times [2025-03-04 10:53:02,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:02,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662570937] [2025-03-04 10:53:02,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:02,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:02,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:53:02,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:53:02,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:02,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:02,593 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:02,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:02,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662570937] [2025-03-04 10:53:02,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662570937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:02,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777005600] [2025-03-04 10:53:02,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:02,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:02,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:02,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:02,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:53:02,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-04 10:53:02,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-04 10:53:02,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:02,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:02,634 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:02,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:02,709 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:02,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777005600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:02,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:02,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 10:53:02,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444907341] [2025-03-04 10:53:02,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:02,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:02,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:02,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:02,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:02,710 INFO L87 Difference]: Start difference. First operand 442 states and 526 transitions. Second operand has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:02,798 INFO L93 Difference]: Finished difference Result 444 states and 526 transitions. [2025-03-04 10:53:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:02,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 91 [2025-03-04 10:53:02,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:02,800 INFO L225 Difference]: With dead ends: 444 [2025-03-04 10:53:02,800 INFO L226 Difference]: Without dead ends: 436 [2025-03-04 10:53:02,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:02,801 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 255 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:02,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 375 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:02,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-04 10:53:02,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2025-03-04 10:53:02,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 296 states have (on average 1.5945945945945945) internal successors, (472), 410 states have internal predecessors, (472), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 10:53:02,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 516 transitions. [2025-03-04 10:53:02,812 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 516 transitions. Word has length 91 [2025-03-04 10:53:02,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:02,812 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 516 transitions. [2025-03-04 10:53:02,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 23.0) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2025-03-04 10:53:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 516 transitions. [2025-03-04 10:53:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-04 10:53:02,813 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:02,813 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:02,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:03,013 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,SelfDestructingSolverStorable15 [2025-03-04 10:53:03,014 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:03,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:03,014 INFO L85 PathProgramCache]: Analyzing trace with hash -389018303, now seen corresponding path program 1 times [2025-03-04 10:53:03,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038618998] [2025-03-04 10:53:03,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:03,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:03,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 10:53:03,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:53:03,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:03,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:03,063 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:03,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038618998] [2025-03-04 10:53:03,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038618998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:03,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771378821] [2025-03-04 10:53:03,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:03,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:03,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:03,065 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:03,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:53:03,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 10:53:03,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 10:53:03,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:03,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:03,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 10:53:03,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:03,169 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:03,170 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:03,277 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:03,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771378821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:03,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:03,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 10:53:03,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356981003] [2025-03-04 10:53:03,278 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:03,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:53:03,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:03,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:53:03,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:03,279 INFO L87 Difference]: Start difference. First operand 434 states and 516 transitions. Second operand has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:03,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:03,421 INFO L93 Difference]: Finished difference Result 779 states and 948 transitions. [2025-03-04 10:53:03,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:03,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 92 [2025-03-04 10:53:03,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:03,423 INFO L225 Difference]: With dead ends: 779 [2025-03-04 10:53:03,424 INFO L226 Difference]: Without dead ends: 771 [2025-03-04 10:53:03,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:03,424 INFO L435 NwaCegarLoop]: 263 mSDtfsCounter, 458 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 475 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:03,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [475 Valid, 974 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-03-04 10:53:03,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 505. [2025-03-04 10:53:03,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 367 states have (on average 1.561307901907357) internal successors, (573), 476 states have internal predecessors, (573), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 10:53:03,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 627 transitions. [2025-03-04 10:53:03,436 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 627 transitions. Word has length 92 [2025-03-04 10:53:03,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:03,436 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 627 transitions. [2025-03-04 10:53:03,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 31.666666666666668) internal successors, (190), 7 states have internal predecessors, (190), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 10:53:03,437 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 627 transitions. [2025-03-04 10:53:03,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 10:53:03,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:03,437 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:03,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:03,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:53:03,638 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:03,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:03,638 INFO L85 PathProgramCache]: Analyzing trace with hash -607411062, now seen corresponding path program 1 times [2025-03-04 10:53:03,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:03,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645539102] [2025-03-04 10:53:03,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:03,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:03,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 10:53:03,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 10:53:03,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:03,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:03,739 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:03,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:03,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645539102] [2025-03-04 10:53:03,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645539102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:03,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1862547773] [2025-03-04 10:53:03,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:03,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:03,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:03,743 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:03,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:53:03,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 10:53:03,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 10:53:03,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:03,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:03,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:03,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-04 10:53:03,883 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:03,973 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:03,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1862547773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:03,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:03,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 6] total 9 [2025-03-04 10:53:03,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251911997] [2025-03-04 10:53:03,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:03,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:03,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:03,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:03,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:03,975 INFO L87 Difference]: Start difference. First operand 505 states and 627 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:53:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:04,030 INFO L93 Difference]: Finished difference Result 676 states and 798 transitions. [2025-03-04 10:53:04,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:53:04,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2025-03-04 10:53:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:04,032 INFO L225 Difference]: With dead ends: 676 [2025-03-04 10:53:04,032 INFO L226 Difference]: Without dead ends: 511 [2025-03-04 10:53:04,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 196 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:53:04,033 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 29 mSDsluCounter, 1061 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 1335 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:04,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 1335 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:53:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-03-04 10:53:04,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 509. [2025-03-04 10:53:04,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 370 states have (on average 1.554054054054054) internal successors, (575), 479 states have internal predecessors, (575), 27 states have call successors, (27), 3 states have call predecessors, (27), 3 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-04 10:53:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 629 transitions. [2025-03-04 10:53:04,045 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 629 transitions. Word has length 101 [2025-03-04 10:53:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:04,045 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 629 transitions. [2025-03-04 10:53:04,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 2 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-04 10:53:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 629 transitions. [2025-03-04 10:53:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 10:53:04,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:04,046 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:04,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:04,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:04,248 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:04,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:04,248 INFO L85 PathProgramCache]: Analyzing trace with hash 979995133, now seen corresponding path program 1 times [2025-03-04 10:53:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234721430] [2025-03-04 10:53:04,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:04,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:04,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:53:04,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:53:04,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:04,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:04,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2093577098] [2025-03-04 10:53:04,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:04,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:04,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:04,274 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:04,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:53:04,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 10:53:04,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 10:53:04,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:04,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:04,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:04,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:04,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-04 10:53:04,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234721430] [2025-03-04 10:53:04,515 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093577098] [2025-03-04 10:53:04,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093577098] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:04,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:04,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-04 10:53:04,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145481264] [2025-03-04 10:53:04,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:04,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:04,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:04,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:04,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:53:04,517 INFO L87 Difference]: Start difference. First operand 509 states and 629 transitions. Second operand has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:04,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:04,686 INFO L93 Difference]: Finished difference Result 869 states and 967 transitions. [2025-03-04 10:53:04,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:04,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 103 [2025-03-04 10:53:04,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:04,689 INFO L225 Difference]: With dead ends: 869 [2025-03-04 10:53:04,689 INFO L226 Difference]: Without dead ends: 863 [2025-03-04 10:53:04,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:53:04,690 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 829 mSDsluCounter, 854 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:04,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 1302 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:53:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-03-04 10:53:04,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 509. [2025-03-04 10:53:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 374 states have (on average 1.5240641711229947) internal successors, (570), 478 states have internal predecessors, (570), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:53:04,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 626 transitions. [2025-03-04 10:53:04,705 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 626 transitions. Word has length 103 [2025-03-04 10:53:04,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:04,705 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 626 transitions. [2025-03-04 10:53:04,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 29.6) internal successors, (148), 6 states have internal predecessors, (148), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-04 10:53:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 626 transitions. [2025-03-04 10:53:04,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 10:53:04,706 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:04,706 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:04,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 10:53:04,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:04,907 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:04,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:04,907 INFO L85 PathProgramCache]: Analyzing trace with hash -759090339, now seen corresponding path program 1 times [2025-03-04 10:53:04,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:04,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134729970] [2025-03-04 10:53:04,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:04,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:04,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 10:53:04,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:53:04,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:04,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:04,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [180553387] [2025-03-04 10:53:04,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:04,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:04,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:04,923 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:04,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:53:04,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 10:53:04,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 10:53:04,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:04,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:04,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:04,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:05,058 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:53:05,058 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:05,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134729970] [2025-03-04 10:53:05,058 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:05,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180553387] [2025-03-04 10:53:05,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180553387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:05,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:05,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:05,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685323952] [2025-03-04 10:53:05,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:05,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:05,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:05,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:05,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:05,060 INFO L87 Difference]: Start difference. First operand 509 states and 626 transitions. Second operand has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:05,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:05,335 INFO L93 Difference]: Finished difference Result 510 states and 626 transitions. [2025-03-04 10:53:05,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:05,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 105 [2025-03-04 10:53:05,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:05,338 INFO L225 Difference]: With dead ends: 510 [2025-03-04 10:53:05,338 INFO L226 Difference]: Without dead ends: 509 [2025-03-04 10:53:05,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:05,339 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 64 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:05,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 465 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2025-03-04 10:53:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 509. [2025-03-04 10:53:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 374 states have (on average 1.5213903743315509) internal successors, (569), 478 states have internal predecessors, (569), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:53:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 625 transitions. [2025-03-04 10:53:05,359 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 625 transitions. Word has length 105 [2025-03-04 10:53:05,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:05,359 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 625 transitions. [2025-03-04 10:53:05,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.333333333333332) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:05,359 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 625 transitions. [2025-03-04 10:53:05,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 10:53:05,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:05,360 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:05,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 10:53:05,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:05,564 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:05,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:05,564 INFO L85 PathProgramCache]: Analyzing trace with hash -2056963920, now seen corresponding path program 1 times [2025-03-04 10:53:05,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629500656] [2025-03-04 10:53:05,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:05,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:05,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 10:53:05,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 10:53:05,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:05,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:05,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1609944686] [2025-03-04 10:53:05,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:05,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:05,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:05,584 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:05,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:53:05,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 10:53:05,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 10:53:05,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:05,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:05,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:05,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:05,832 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:53:05,833 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:05,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:05,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629500656] [2025-03-04 10:53:05,833 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:05,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609944686] [2025-03-04 10:53:05,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609944686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:05,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:05,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:53:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251504692] [2025-03-04 10:53:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:05,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:53:05,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:05,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:53:05,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:53:05,834 INFO L87 Difference]: Start difference. First operand 509 states and 625 transitions. Second operand has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:06,172 INFO L93 Difference]: Finished difference Result 510 states and 625 transitions. [2025-03-04 10:53:06,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:53:06,173 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 106 [2025-03-04 10:53:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:06,175 INFO L225 Difference]: With dead ends: 510 [2025-03-04 10:53:06,175 INFO L226 Difference]: Without dead ends: 489 [2025-03-04 10:53:06,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:06,176 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 20 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:06,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 393 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2025-03-04 10:53:06,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2025-03-04 10:53:06,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 356 states have (on average 1.5449438202247192) internal successors, (550), 460 states have internal predecessors, (550), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:06,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 602 transitions. [2025-03-04 10:53:06,188 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 602 transitions. Word has length 106 [2025-03-04 10:53:06,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:06,189 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 602 transitions. [2025-03-04 10:53:06,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.666666666666668) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:06,189 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 602 transitions. [2025-03-04 10:53:06,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 10:53:06,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:06,189 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:06,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:06,390 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,SelfDestructingSolverStorable20 [2025-03-04 10:53:06,391 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:06,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:06,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1927118886, now seen corresponding path program 1 times [2025-03-04 10:53:06,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:06,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374942278] [2025-03-04 10:53:06,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:06,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:06,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 10:53:06,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 10:53:06,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:06,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:06,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [924120934] [2025-03-04 10:53:06,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:06,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:06,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:06,412 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:06,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:53:06,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 10:53:06,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 10:53:06,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:06,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:06,456 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:53:06,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:06,651 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:53:06,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:06,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374942278] [2025-03-04 10:53:06,651 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:06,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924120934] [2025-03-04 10:53:06,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924120934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:06,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:06,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:53:06,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245412618] [2025-03-04 10:53:06,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:06,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:06,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:06,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:06,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:53:06,652 INFO L87 Difference]: Start difference. First operand 489 states and 602 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 10:53:07,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:07,112 INFO L93 Difference]: Finished difference Result 489 states and 602 transitions. [2025-03-04 10:53:07,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:53:07,116 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 124 [2025-03-04 10:53:07,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:07,118 INFO L225 Difference]: With dead ends: 489 [2025-03-04 10:53:07,118 INFO L226 Difference]: Without dead ends: 479 [2025-03-04 10:53:07,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:53:07,119 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 136 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 619 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:07,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 299 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 619 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:07,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-03-04 10:53:07,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-03-04 10:53:07,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 356 states have (on average 1.4943820224719102) internal successors, (532), 450 states have internal predecessors, (532), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 10:53:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 584 transitions. [2025-03-04 10:53:07,131 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 584 transitions. Word has length 124 [2025-03-04 10:53:07,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:07,132 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 584 transitions. [2025-03-04 10:53:07,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 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 10:53:07,132 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 584 transitions. [2025-03-04 10:53:07,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 10:53:07,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:07,133 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:07,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 10:53:07,333 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,SelfDestructingSolverStorable21 [2025-03-04 10:53:07,333 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:07,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:07,334 INFO L85 PathProgramCache]: Analyzing trace with hash -388856459, now seen corresponding path program 1 times [2025-03-04 10:53:07,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:07,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957668439] [2025-03-04 10:53:07,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:07,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 10:53:07,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 10:53:07,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:07,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [692359572] [2025-03-04 10:53:07,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:07,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:07,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:07,354 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:07,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:53:07,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 10:53:07,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 10:53:07,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:07,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:07,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 10:53:07,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:07,621 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:07,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:07,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:07,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957668439] [2025-03-04 10:53:07,996 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:07,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692359572] [2025-03-04 10:53:07,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692359572] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:07,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:07,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:07,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412272111] [2025-03-04 10:53:07,996 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:07,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:07,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:07,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:07,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:07,997 INFO L87 Difference]: Start difference. First operand 479 states and 584 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 10:53:08,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:08,518 INFO L93 Difference]: Finished difference Result 605 states and 743 transitions. [2025-03-04 10:53:08,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:53:08,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 125 [2025-03-04 10:53:08,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:08,520 INFO L225 Difference]: With dead ends: 605 [2025-03-04 10:53:08,520 INFO L226 Difference]: Without dead ends: 582 [2025-03-04 10:53:08,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:08,521 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 131 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:08,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 557 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:08,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2025-03-04 10:53:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 564. [2025-03-04 10:53:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 436 states have (on average 1.4931192660550459) internal successors, (651), 530 states have internal predecessors, (651), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 10:53:08,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 713 transitions. [2025-03-04 10:53:08,537 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 713 transitions. Word has length 125 [2025-03-04 10:53:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:08,537 INFO L471 AbstractCegarLoop]: Abstraction has 564 states and 713 transitions. [2025-03-04 10:53:08,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 10:53:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 713 transitions. [2025-03-04 10:53:08,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-04 10:53:08,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:08,538 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:08,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 10:53:08,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-04 10:53:08,744 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:08,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:08,745 INFO L85 PathProgramCache]: Analyzing trace with hash 830351876, now seen corresponding path program 1 times [2025-03-04 10:53:08,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:08,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024869254] [2025-03-04 10:53:08,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:08,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:08,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 10:53:08,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 10:53:08,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:08,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:08,816 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:08,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024869254] [2025-03-04 10:53:08,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024869254] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:08,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2011784431] [2025-03-04 10:53:08,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:08,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:08,818 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:08,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:53:08,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-04 10:53:08,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-04 10:53:08,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:08,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:08,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:08,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:09,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:09,142 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:09,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2011784431] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:09,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:09,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:09,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921236543] [2025-03-04 10:53:09,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:09,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:09,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:09,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:09,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:09,144 INFO L87 Difference]: Start difference. First operand 564 states and 713 transitions. Second operand has 8 states, 7 states have (on average 33.142857142857146) internal successors, (232), 8 states have internal predecessors, (232), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:09,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:09,815 INFO L93 Difference]: Finished difference Result 608 states and 720 transitions. [2025-03-04 10:53:09,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:09,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 33.142857142857146) internal successors, (232), 8 states have internal predecessors, (232), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 126 [2025-03-04 10:53:09,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:09,817 INFO L225 Difference]: With dead ends: 608 [2025-03-04 10:53:09,817 INFO L226 Difference]: Without dead ends: 603 [2025-03-04 10:53:09,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:09,818 INFO L435 NwaCegarLoop]: 298 mSDtfsCounter, 424 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 1172 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:09,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 924 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1172 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 10:53:09,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-04 10:53:09,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 563. [2025-03-04 10:53:09,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 436 states have (on average 1.4724770642201834) internal successors, (642), 529 states have internal predecessors, (642), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 10:53:09,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 704 transitions. [2025-03-04 10:53:09,831 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 704 transitions. Word has length 126 [2025-03-04 10:53:09,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:09,831 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 704 transitions. [2025-03-04 10:53:09,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 33.142857142857146) internal successors, (232), 8 states have internal predecessors, (232), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:09,832 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 704 transitions. [2025-03-04 10:53:09,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 10:53:09,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:09,833 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:09,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:10,038 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,SelfDestructingSolverStorable23 [2025-03-04 10:53:10,038 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:10,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash -28895405, now seen corresponding path program 1 times [2025-03-04 10:53:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:10,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595634739] [2025-03-04 10:53:10,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:10,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:10,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:10,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,123 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:10,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595634739] [2025-03-04 10:53:10,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595634739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:10,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481401114] [2025-03-04 10:53:10,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:10,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:10,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:10,126 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:10,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:53:10,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 10:53:10,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 10:53:10,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:10,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:10,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:10,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:10,322 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:10,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:10,451 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:10,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481401114] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:10,452 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:10,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2025-03-04 10:53:10,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679513963] [2025-03-04 10:53:10,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:10,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 10:53:10,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:10,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 10:53:10,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:10,454 INFO L87 Difference]: Start difference. First operand 563 states and 704 transitions. Second operand has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 8 states have internal predecessors, (234), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:11,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:11,006 INFO L93 Difference]: Finished difference Result 607 states and 711 transitions. [2025-03-04 10:53:11,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:11,007 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 8 states have internal predecessors, (234), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) Word has length 127 [2025-03-04 10:53:11,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:11,008 INFO L225 Difference]: With dead ends: 607 [2025-03-04 10:53:11,010 INFO L226 Difference]: Without dead ends: 602 [2025-03-04 10:53:11,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 250 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:11,011 INFO L435 NwaCegarLoop]: 248 mSDtfsCounter, 422 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:11,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 806 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 10:53:11,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2025-03-04 10:53:11,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 562. [2025-03-04 10:53:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 436 states have (on average 1.451834862385321) internal successors, (633), 528 states have internal predecessors, (633), 31 states have call successors, (31), 3 states have call predecessors, (31), 3 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2025-03-04 10:53:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 695 transitions. [2025-03-04 10:53:11,026 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 695 transitions. Word has length 127 [2025-03-04 10:53:11,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:11,026 INFO L471 AbstractCegarLoop]: Abstraction has 562 states and 695 transitions. [2025-03-04 10:53:11,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 8 states have internal predecessors, (234), 5 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 5 states have call predecessors, (21), 5 states have call successors, (21) [2025-03-04 10:53:11,027 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 695 transitions. [2025-03-04 10:53:11,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-04 10:53:11,029 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:11,029 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:11,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:11,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:11,234 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:11,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:11,234 INFO L85 PathProgramCache]: Analyzing trace with hash -895757342, now seen corresponding path program 1 times [2025-03-04 10:53:11,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:11,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285547377] [2025-03-04 10:53:11,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:11,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 10:53:11,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 10:53:11,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:11,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [456858470] [2025-03-04 10:53:11,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:11,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:11,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:11,251 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:11,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:53:11,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 10:53:11,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 10:53:11,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:11,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:11,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-04 10:53:11,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:11,637 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-04 10:53:11,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:11,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285547377] [2025-03-04 10:53:11,833 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:11,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456858470] [2025-03-04 10:53:11,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456858470] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:11,833 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:11,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:53:11,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230378396] [2025-03-04 10:53:11,833 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:11,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:53:11,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:11,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:53:11,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:11,834 INFO L87 Difference]: Start difference. First operand 562 states and 695 transitions. Second operand has 10 states, 9 states have (on average 19.77777777777778) internal successors, (178), 10 states have internal predecessors, (178), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:14,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:14,137 INFO L93 Difference]: Finished difference Result 627 states and 727 transitions. [2025-03-04 10:53:14,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 10:53:14,137 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 19.77777777777778) internal successors, (178), 10 states have internal predecessors, (178), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) Word has length 128 [2025-03-04 10:53:14,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:14,139 INFO L225 Difference]: With dead ends: 627 [2025-03-04 10:53:14,139 INFO L226 Difference]: Without dead ends: 532 [2025-03-04 10:53:14,140 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:53:14,140 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 633 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:14,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 522 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 10:53:14,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2025-03-04 10:53:14,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 509. [2025-03-04 10:53:14,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 388 states have (on average 1.407216494845361) internal successors, (546), 478 states have internal predecessors, (546), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:53:14,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 602 transitions. [2025-03-04 10:53:14,151 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 602 transitions. Word has length 128 [2025-03-04 10:53:14,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:14,151 INFO L471 AbstractCegarLoop]: Abstraction has 509 states and 602 transitions. [2025-03-04 10:53:14,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 19.77777777777778) internal successors, (178), 10 states have internal predecessors, (178), 4 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 4 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-04 10:53:14,152 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 602 transitions. [2025-03-04 10:53:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 10:53:14,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:14,153 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:53:14,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:14,356 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 10:53:14,357 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:14,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:14,358 INFO L85 PathProgramCache]: Analyzing trace with hash -190293075, now seen corresponding path program 1 times [2025-03-04 10:53:14,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:14,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678806476] [2025-03-04 10:53:14,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:14,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 10:53:14,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 10:53:14,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,405 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2025-03-04 10:53:14,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:14,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678806476] [2025-03-04 10:53:14,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678806476] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:53:14,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:53:14,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:53:14,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302944960] [2025-03-04 10:53:14,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:53:14,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:53:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:14,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:53:14,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:14,406 INFO L87 Difference]: Start difference. First operand 509 states and 602 transitions. Second operand has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:14,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:14,637 INFO L93 Difference]: Finished difference Result 515 states and 602 transitions. [2025-03-04 10:53:14,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:53:14,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 170 [2025-03-04 10:53:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:14,638 INFO L225 Difference]: With dead ends: 515 [2025-03-04 10:53:14,639 INFO L226 Difference]: Without dead ends: 512 [2025-03-04 10:53:14,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:53:14,639 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 133 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:14,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 237 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:53:14,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2025-03-04 10:53:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 507. [2025-03-04 10:53:14,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 388 states have (on average 1.3969072164948453) internal successors, (542), 476 states have internal predecessors, (542), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:53:14,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 598 transitions. [2025-03-04 10:53:14,652 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 598 transitions. Word has length 170 [2025-03-04 10:53:14,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:14,653 INFO L471 AbstractCegarLoop]: Abstraction has 507 states and 598 transitions. [2025-03-04 10:53:14,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 45.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 10:53:14,653 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 598 transitions. [2025-03-04 10:53:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-03-04 10:53:14,654 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:14,654 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:14,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 10:53:14,654 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:14,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:14,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1348048934, now seen corresponding path program 1 times [2025-03-04 10:53:14,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:14,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157549496] [2025-03-04 10:53:14,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:14,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 10:53:14,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 10:53:14,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,731 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:14,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:14,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157549496] [2025-03-04 10:53:14,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157549496] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:14,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415963420] [2025-03-04 10:53:14,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:14,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:14,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:14,734 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 10:53:14,736 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 10:53:14,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 10:53:14,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 10:53:14,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:14,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:14,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:53:14,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:14,892 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:14,892 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415963420] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:15,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:53:15,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 10:53:15,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213088601] [2025-03-04 10:53:15,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:15,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:15,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:15,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:15,028 INFO L87 Difference]: Start difference. First operand 507 states and 598 transitions. Second operand has 9 states, 8 states have (on average 36.5) internal successors, (292), 9 states have internal predecessors, (292), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 10:53:15,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:15,349 INFO L93 Difference]: Finished difference Result 679 states and 762 transitions. [2025-03-04 10:53:15,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:53:15,349 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 36.5) internal successors, (292), 9 states have internal predecessors, (292), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) Word has length 173 [2025-03-04 10:53:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:15,351 INFO L225 Difference]: With dead ends: 679 [2025-03-04 10:53:15,351 INFO L226 Difference]: Without dead ends: 677 [2025-03-04 10:53:15,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:53:15,351 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 1033 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1033 SdHoareTripleChecker+Valid, 931 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:15,352 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1033 Valid, 931 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:53:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-04 10:53:15,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 505. [2025-03-04 10:53:15,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 388 states have (on average 1.3814432989690721) internal successors, (536), 474 states have internal predecessors, (536), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:53:15,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 592 transitions. [2025-03-04 10:53:15,363 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 592 transitions. Word has length 173 [2025-03-04 10:53:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:15,364 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 592 transitions. [2025-03-04 10:53:15,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 36.5) internal successors, (292), 9 states have internal predecessors, (292), 7 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 7 states have call predecessors, (27), 7 states have call successors, (27) [2025-03-04 10:53:15,364 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 592 transitions. [2025-03-04 10:53:15,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-03-04 10:53:15,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:15,365 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:15,371 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 10:53:15,565 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,SelfDestructingSolverStorable27 [2025-03-04 10:53:15,566 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:15,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:15,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1160156138, now seen corresponding path program 1 times [2025-03-04 10:53:15,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:15,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794325889] [2025-03-04 10:53:15,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:15,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:15,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 10:53:15,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 10:53:15,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:15,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:15,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1539839101] [2025-03-04 10:53:15,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:15,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:15,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:15,588 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 10:53:15,590 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 10:53:15,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-04 10:53:15,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-04 10:53:15,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:15,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:15,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:53:15,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:15,939 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:15,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:16,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794325889] [2025-03-04 10:53:16,552 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:16,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539839101] [2025-03-04 10:53:16,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539839101] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:16,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:16,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2025-03-04 10:53:16,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413474882] [2025-03-04 10:53:16,552 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:16,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:53:16,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:16,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:53:16,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:16,553 INFO L87 Difference]: Start difference. First operand 505 states and 592 transitions. Second operand has 5 states, 4 states have (on average 30.5) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 10:53:17,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:17,011 INFO L93 Difference]: Finished difference Result 506 states and 592 transitions. [2025-03-04 10:53:17,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:17,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 30.5) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 174 [2025-03-04 10:53:17,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:17,014 INFO L225 Difference]: With dead ends: 506 [2025-03-04 10:53:17,015 INFO L226 Difference]: Without dead ends: 505 [2025-03-04 10:53:17,015 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:17,015 INFO L435 NwaCegarLoop]: 266 mSDtfsCounter, 32 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:17,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 534 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:17,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2025-03-04 10:53:17,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 505. [2025-03-04 10:53:17,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 388 states have (on average 1.3788659793814433) internal successors, (535), 474 states have internal predecessors, (535), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:53:17,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 591 transitions. [2025-03-04 10:53:17,030 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 591 transitions. Word has length 174 [2025-03-04 10:53:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:17,031 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 591 transitions. [2025-03-04 10:53:17,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 30.5) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 10:53:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 591 transitions. [2025-03-04 10:53:17,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-03-04 10:53:17,031 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:17,032 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:17,038 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 10:53:17,232 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,SelfDestructingSolverStorable28 [2025-03-04 10:53:17,232 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:17,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1605102040, now seen corresponding path program 1 times [2025-03-04 10:53:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:17,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002606649] [2025-03-04 10:53:17,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:17,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:17,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 10:53:17,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 10:53:17,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:17,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:17,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1601993484] [2025-03-04 10:53:17,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:17,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:17,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:17,253 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 10:53:17,255 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 10:53:17,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-03-04 10:53:17,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-03-04 10:53:17,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:17,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:17,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:53:17,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:17,636 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:17,636 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:17,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002606649] [2025-03-04 10:53:17,722 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:17,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601993484] [2025-03-04 10:53:17,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601993484] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:17,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:17,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2025-03-04 10:53:17,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902683918] [2025-03-04 10:53:17,723 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:17,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:53:17,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:17,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:53:17,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:53:17,723 INFO L87 Difference]: Start difference. First operand 505 states and 591 transitions. Second operand has 6 states, 5 states have (on average 24.6) internal successors, (123), 6 states have internal predecessors, (123), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:18,173 INFO L93 Difference]: Finished difference Result 516 states and 591 transitions. [2025-03-04 10:53:18,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 10:53:18,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 24.6) internal successors, (123), 6 states have internal predecessors, (123), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 175 [2025-03-04 10:53:18,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:18,175 INFO L225 Difference]: With dead ends: 516 [2025-03-04 10:53:18,175 INFO L226 Difference]: Without dead ends: 515 [2025-03-04 10:53:18,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:18,175 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 69 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 986 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:18,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 640 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 986 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 10:53:18,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2025-03-04 10:53:18,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 505. [2025-03-04 10:53:18,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 388 states have (on average 1.3762886597938144) internal successors, (534), 474 states have internal predecessors, (534), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:53:18,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 590 transitions. [2025-03-04 10:53:18,202 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 590 transitions. Word has length 175 [2025-03-04 10:53:18,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:18,202 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 590 transitions. [2025-03-04 10:53:18,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 24.6) internal successors, (123), 6 states have internal predecessors, (123), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:18,203 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 590 transitions. [2025-03-04 10:53:18,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-04 10:53:18,203 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:18,203 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:18,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 10:53:18,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:18,408 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:18,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:18,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1724094310, now seen corresponding path program 1 times [2025-03-04 10:53:18,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:18,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431349026] [2025-03-04 10:53:18,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:18,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:18,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 10:53:18,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 10:53:18,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:18,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:18,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1121457902] [2025-03-04 10:53:18,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:18,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:18,431 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 10:53:18,432 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 10:53:18,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-04 10:53:18,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-04 10:53:18,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:18,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:18,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:53:18,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:19,607 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:19,608 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:20,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:20,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431349026] [2025-03-04 10:53:20,060 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:20,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121457902] [2025-03-04 10:53:20,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121457902] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:20,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:20,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-03-04 10:53:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898606268] [2025-03-04 10:53:20,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:20,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 10:53:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:20,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 10:53:20,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:53:20,061 INFO L87 Difference]: Start difference. First operand 505 states and 590 transitions. Second operand has 10 states, 9 states have (on average 27.555555555555557) internal successors, (248), 10 states have internal predecessors, (248), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:22,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:23,000 INFO L93 Difference]: Finished difference Result 529 states and 614 transitions. [2025-03-04 10:53:23,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:53:23,000 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 27.555555555555557) internal successors, (248), 10 states have internal predecessors, (248), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 178 [2025-03-04 10:53:23,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:23,001 INFO L225 Difference]: With dead ends: 529 [2025-03-04 10:53:23,001 INFO L226 Difference]: Without dead ends: 521 [2025-03-04 10:53:23,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-03-04 10:53:23,002 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 222 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 2425 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 2445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:23,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 503 Invalid, 2445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2425 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-03-04 10:53:23,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-04 10:53:23,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 505. [2025-03-04 10:53:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 505 states, 388 states have (on average 1.3556701030927836) internal successors, (526), 474 states have internal predecessors, (526), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:53:23,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 582 transitions. [2025-03-04 10:53:23,013 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 582 transitions. Word has length 178 [2025-03-04 10:53:23,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:23,014 INFO L471 AbstractCegarLoop]: Abstraction has 505 states and 582 transitions. [2025-03-04 10:53:23,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 27.555555555555557) internal successors, (248), 10 states have internal predecessors, (248), 4 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-04 10:53:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 582 transitions. [2025-03-04 10:53:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-04 10:53:23,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:23,014 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:23,023 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 10:53:23,215 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 10:53:23,215 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:23,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash -8750368, now seen corresponding path program 1 times [2025-03-04 10:53:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:23,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177676286] [2025-03-04 10:53:23,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:23,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:23,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 10:53:23,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 10:53:23,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:23,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:23,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1303874465] [2025-03-04 10:53:23,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:23,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:23,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:23,233 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:23,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-03-04 10:53:23,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-04 10:53:23,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-04 10:53:23,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:23,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:23,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 10:53:23,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:24,252 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:24,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:24,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177676286] [2025-03-04 10:53:24,456 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:24,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303874465] [2025-03-04 10:53:24,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303874465] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:24,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:24,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2025-03-04 10:53:24,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518336479] [2025-03-04 10:53:24,456 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:24,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:53:24,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:24,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:53:24,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:53:24,457 INFO L87 Difference]: Start difference. First operand 505 states and 582 transitions. Second operand has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:25,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:25,299 INFO L93 Difference]: Finished difference Result 505 states and 582 transitions. [2025-03-04 10:53:25,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 10:53:25,299 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 186 [2025-03-04 10:53:25,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:25,300 INFO L225 Difference]: With dead ends: 505 [2025-03-04 10:53:25,300 INFO L226 Difference]: Without dead ends: 495 [2025-03-04 10:53:25,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:25,301 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 565 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 1240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:25,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 213 Invalid, 1240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 10:53:25,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-04 10:53:25,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-04 10:53:25,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 388 states have (on average 1.3170103092783505) internal successors, (511), 464 states have internal predecessors, (511), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 10:53:25,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 567 transitions. [2025-03-04 10:53:25,314 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 567 transitions. Word has length 186 [2025-03-04 10:53:25,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:25,314 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 567 transitions. [2025-03-04 10:53:25,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 22.333333333333332) internal successors, (134), 7 states have internal predecessors, (134), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:25,314 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 567 transitions. [2025-03-04 10:53:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-04 10:53:25,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:25,315 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:25,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-03-04 10:53:25,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2025-03-04 10:53:25,516 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:25,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:25,516 INFO L85 PathProgramCache]: Analyzing trace with hash -271261278, now seen corresponding path program 1 times [2025-03-04 10:53:25,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:25,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075394119] [2025-03-04 10:53:25,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:25,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:25,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 10:53:25,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 10:53:25,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:25,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:25,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79022760] [2025-03-04 10:53:25,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:25,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:25,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:25,532 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:25,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-03-04 10:53:25,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-04 10:53:25,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-04 10:53:25,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:25,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:25,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:53:25,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:26,602 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:26,603 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:26,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075394119] [2025-03-04 10:53:26,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:26,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79022760] [2025-03-04 10:53:26,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79022760] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:26,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:26,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:53:26,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799157898] [2025-03-04 10:53:26,799 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:26,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:26,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:26,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:26,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:53:26,800 INFO L87 Difference]: Start difference. First operand 495 states and 567 transitions. Second operand has 9 states, 8 states have (on average 16.875) internal successors, (135), 9 states have internal predecessors, (135), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:27,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:27,729 INFO L93 Difference]: Finished difference Result 735 states and 899 transitions. [2025-03-04 10:53:27,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:27,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 16.875) internal successors, (135), 9 states have internal predecessors, (135), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 187 [2025-03-04 10:53:27,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:27,732 INFO L225 Difference]: With dead ends: 735 [2025-03-04 10:53:27,732 INFO L226 Difference]: Without dead ends: 730 [2025-03-04 10:53:27,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-03-04 10:53:27,732 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 193 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 2479 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 2484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:27,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 601 Invalid, 2484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2479 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 10:53:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2025-03-04 10:53:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 590. [2025-03-04 10:53:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 475 states have (on average 1.345263157894737) internal successors, (639), 551 states have internal predecessors, (639), 36 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (36), 35 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 10:53:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 711 transitions. [2025-03-04 10:53:27,748 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 711 transitions. Word has length 187 [2025-03-04 10:53:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:27,748 INFO L471 AbstractCegarLoop]: Abstraction has 590 states and 711 transitions. [2025-03-04 10:53:27,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 16.875) internal successors, (135), 9 states have internal predecessors, (135), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 711 transitions. [2025-03-04 10:53:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-03-04 10:53:27,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:27,749 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:27,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-03-04 10:53:27,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 10:53:27,949 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:27,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:27,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1310920992, now seen corresponding path program 1 times [2025-03-04 10:53:27,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:27,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707721453] [2025-03-04 10:53:27,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:27,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:27,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 10:53:27,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 10:53:27,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:27,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:27,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [250943206] [2025-03-04 10:53:27,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:27,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:27,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:27,975 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:27,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-03-04 10:53:28,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 10:53:28,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 10:53:28,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:28,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:28,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 10:53:28,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:28,518 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:32,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:32,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707721453] [2025-03-04 10:53:32,714 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:32,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250943206] [2025-03-04 10:53:32,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250943206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:53:32,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:53:32,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2025-03-04 10:53:32,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737779291] [2025-03-04 10:53:32,714 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:32,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:53:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:32,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:53:32,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=88, Unknown=1, NotChecked=0, Total=132 [2025-03-04 10:53:32,715 INFO L87 Difference]: Start difference. First operand 590 states and 711 transitions. Second operand has 9 states, 8 states have (on average 17.125) internal successors, (137), 9 states have internal predecessors, (137), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:33,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:53:33,422 INFO L93 Difference]: Finished difference Result 721 states and 893 transitions. [2025-03-04 10:53:33,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:53:33,423 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 17.125) internal successors, (137), 9 states have internal predecessors, (137), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 189 [2025-03-04 10:53:33,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:53:33,424 INFO L225 Difference]: With dead ends: 721 [2025-03-04 10:53:33,424 INFO L226 Difference]: Without dead ends: 709 [2025-03-04 10:53:33,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=43, Invalid=88, Unknown=1, NotChecked=0, Total=132 [2025-03-04 10:53:33,425 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 167 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 1944 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:53:33,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 745 Invalid, 1955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1944 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:53:33,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2025-03-04 10:53:33,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 670. [2025-03-04 10:53:33,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 551 states have (on average 1.3484573502722323) internal successors, (743), 627 states have internal predecessors, (743), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 10:53:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 823 transitions. [2025-03-04 10:53:33,447 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 823 transitions. Word has length 189 [2025-03-04 10:53:33,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:53:33,447 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 823 transitions. [2025-03-04 10:53:33,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 17.125) internal successors, (137), 9 states have internal predecessors, (137), 3 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-04 10:53:33,447 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 823 transitions. [2025-03-04 10:53:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-03-04 10:53:33,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:53:33,448 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:53:33,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2025-03-04 10:53:33,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:33,652 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:53:33,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:53:33,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1983845212, now seen corresponding path program 1 times [2025-03-04 10:53:33,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:53:33,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231950848] [2025-03-04 10:53:33,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:53:33,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 10:53:33,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 10:53:33,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:33,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:53:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [444541148] [2025-03-04 10:53:33,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:53:33,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:53:33,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:53:33,673 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:53:33,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-03-04 10:53:33,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-04 10:53:33,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-04 10:53:33,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:53:33,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:53:33,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-04 10:53:33,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:53:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:34,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:53:35,458 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 10:53:35,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:53:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231950848] [2025-03-04 10:53:35,459 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:53:35,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444541148] [2025-03-04 10:53:35,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [444541148] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:53:35,459 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:53:35,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:53:35,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696621695] [2025-03-04 10:53:35,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:53:35,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:53:35,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:53:35,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:53:35,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:53:35,460 INFO L87 Difference]: Start difference. First operand 670 states and 823 transitions. Second operand has 16 states, 15 states have (on average 18.133333333333333) internal successors, (272), 16 states have internal predecessors, (272), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 10:53:43,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:53:47,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:53:51,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:53:56,926 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:54:00,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-03-04 10:54:01,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:01,304 INFO L93 Difference]: Finished difference Result 831 states and 1023 transitions. [2025-03-04 10:54:01,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:54:01,305 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 18.133333333333333) internal successors, (272), 16 states have internal predecessors, (272), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) Word has length 190 [2025-03-04 10:54:01,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:01,307 INFO L225 Difference]: With dead ends: 831 [2025-03-04 10:54:01,307 INFO L226 Difference]: Without dead ends: 783 [2025-03-04 10:54:01,307 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 364 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2025-03-04 10:54:01,308 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 729 mSDsluCounter, 773 mSDsCounter, 0 mSdLazyCounter, 4167 mSolverCounterSat, 58 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 892 SdHoareTripleChecker+Invalid, 4226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 4167 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.6s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:01,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 892 Invalid, 4226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 4167 Invalid, 1 Unknown, 0 Unchecked, 25.6s Time] [2025-03-04 10:54:01,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-04 10:54:01,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 724. [2025-03-04 10:54:01,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 724 states, 600 states have (on average 1.335) internal successors, (801), 676 states have internal predecessors, (801), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 44 states have call predecessors, (45), 45 states have call successors, (45) [2025-03-04 10:54:01,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 891 transitions. [2025-03-04 10:54:01,331 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 891 transitions. Word has length 190 [2025-03-04 10:54:01,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:01,332 INFO L471 AbstractCegarLoop]: Abstraction has 724 states and 891 transitions. [2025-03-04 10:54:01,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 18.133333333333333) internal successors, (272), 16 states have internal predecessors, (272), 6 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 6 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-04 10:54:01,332 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 891 transitions. [2025-03-04 10:54:01,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2025-03-04 10:54:01,333 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:01,333 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1] [2025-03-04 10:54:01,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:01,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:01,538 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:01,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash 464769543, now seen corresponding path program 1 times [2025-03-04 10:54:01,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:01,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092850996] [2025-03-04 10:54:01,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:01,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:01,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 10:54:01,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:54:01,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:01,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:01,656 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 103 proven. 9 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:54:01,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:01,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092850996] [2025-03-04 10:54:01,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092850996] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:01,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037020771] [2025-03-04 10:54:01,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:01,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:01,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:01,659 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:01,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-03-04 10:54:01,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-03-04 10:54:01,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-03-04 10:54:01,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:01,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:01,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:54:01,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:01,830 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 290 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-04 10:54:01,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 10:54:01,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037020771] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:01,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:54:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2025-03-04 10:54:01,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365971819] [2025-03-04 10:54:01,955 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:01,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 10:54:01,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:01,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 10:54:01,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-04 10:54:01,956 INFO L87 Difference]: Start difference. First operand 724 states and 891 transitions. Second operand has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 3 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-04 10:54:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:02,054 INFO L93 Difference]: Finished difference Result 784 states and 931 transitions. [2025-03-04 10:54:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:54:02,054 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 3 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 202 [2025-03-04 10:54:02,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:02,055 INFO L225 Difference]: With dead ends: 784 [2025-03-04 10:54:02,055 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 10:54:02,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 397 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2025-03-04 10:54:02,056 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 250 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 1334 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:02,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 1334 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:54:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 10:54:02,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-04 10:54:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 217 states have (on average 1.1382488479262673) internal successors, (247), 247 states have internal predecessors, (247), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:54:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 277 transitions. [2025-03-04 10:54:02,064 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 277 transitions. Word has length 202 [2025-03-04 10:54:02,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:02,065 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 277 transitions. [2025-03-04 10:54:02,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 14.545454545454545) internal successors, (160), 11 states have internal predecessors, (160), 3 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-04 10:54:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 277 transitions. [2025-03-04 10:54:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-03-04 10:54:02,066 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:02,066 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:02,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-03-04 10:54:02,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 10:54:02,267 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:02,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:02,267 INFO L85 PathProgramCache]: Analyzing trace with hash -164602522, now seen corresponding path program 1 times [2025-03-04 10:54:02,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:02,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645693090] [2025-03-04 10:54:02,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:02,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:02,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-04 10:54:02,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-04 10:54:02,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:02,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-04 10:54:02,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:02,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645693090] [2025-03-04 10:54:02,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645693090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:54:02,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:54:02,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:54:02,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119876118] [2025-03-04 10:54:02,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:54:02,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:54:02,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:02,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:54:02,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:54:02,338 INFO L87 Difference]: Start difference. First operand 266 states and 277 transitions. Second operand has 5 states, 4 states have (on average 30.5) internal successors, (122), 5 states have internal predecessors, (122), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:54:02,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:02,523 INFO L93 Difference]: Finished difference Result 266 states and 277 transitions. [2025-03-04 10:54:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:54:02,524 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 30.5) internal successors, (122), 5 states have internal predecessors, (122), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 208 [2025-03-04 10:54:02,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:02,524 INFO L225 Difference]: With dead ends: 266 [2025-03-04 10:54:02,524 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 10:54:02,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:54:02,525 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 195 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:02,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 225 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:54:02,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 10:54:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-04 10:54:02,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 217 states have (on average 1.1059907834101383) internal successors, (240), 240 states have internal predecessors, (240), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:54:02,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 270 transitions. [2025-03-04 10:54:02,536 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 270 transitions. Word has length 208 [2025-03-04 10:54:02,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:02,536 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 270 transitions. [2025-03-04 10:54:02,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 30.5) internal successors, (122), 5 states have internal predecessors, (122), 4 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2025-03-04 10:54:02,536 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 270 transitions. [2025-03-04 10:54:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-04 10:54:02,537 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:02,537 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:02,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 10:54:02,537 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:02,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash -807710791, now seen corresponding path program 1 times [2025-03-04 10:54:02,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:02,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926800802] [2025-03-04 10:54:02,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:02,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:02,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 10:54:02,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 10:54:02,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:02,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:02,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [932841832] [2025-03-04 10:54:02,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:02,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:02,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:02,569 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:02,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-03-04 10:54:02,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-04 10:54:02,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-04 10:54:02,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:02,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:02,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 10:54:02,624 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:03,338 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 33 proven. 72 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-04 10:54:03,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:03,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:03,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926800802] [2025-03-04 10:54:03,772 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:03,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932841832] [2025-03-04 10:54:03,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932841832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:54:03,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:54:03,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2025-03-04 10:54:03,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488305890] [2025-03-04 10:54:03,772 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:03,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 10:54:03,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:03,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 10:54:03,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2025-03-04 10:54:03,773 INFO L87 Difference]: Start difference. First operand 259 states and 270 transitions. Second operand has 14 states, 13 states have (on average 11.923076923076923) internal successors, (155), 14 states have internal predecessors, (155), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:54:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:04,569 INFO L93 Difference]: Finished difference Result 265 states and 276 transitions. [2025-03-04 10:54:04,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:54:04,570 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.923076923076923) internal successors, (155), 14 states have internal predecessors, (155), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) Word has length 209 [2025-03-04 10:54:04,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:04,570 INFO L225 Difference]: With dead ends: 265 [2025-03-04 10:54:04,570 INFO L226 Difference]: Without dead ends: 243 [2025-03-04 10:54:04,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=463, Unknown=0, NotChecked=0, Total=600 [2025-03-04 10:54:04,571 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 131 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 2493 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:04,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 376 Invalid, 2525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2493 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 10:54:04,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-03-04 10:54:04,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 237. [2025-03-04 10:54:04,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 216 states have (on average 1.0092592592592593) internal successors, (218), 218 states have internal predecessors, (218), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 10:54:04,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 248 transitions. [2025-03-04 10:54:04,580 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 248 transitions. Word has length 209 [2025-03-04 10:54:04,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:04,581 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 248 transitions. [2025-03-04 10:54:04,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 11.923076923076923) internal successors, (155), 14 states have internal predecessors, (155), 3 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (12), 4 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-04 10:54:04,581 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 248 transitions. [2025-03-04 10:54:04,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2025-03-04 10:54:04,583 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:54:04,583 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:04,590 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-03-04 10:54:04,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2025-03-04 10:54:04,784 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 137 more)] === [2025-03-04 10:54:04,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:54:04,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1976951450, now seen corresponding path program 1 times [2025-03-04 10:54:04,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:54:04,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493818327] [2025-03-04 10:54:04,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:04,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:54:04,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-04 10:54:04,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 10:54:04,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:04,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 10:54:04,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [510974228] [2025-03-04 10:54:04,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:54:04,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:54:04,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:54:04,810 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:54:04,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-03-04 10:54:04,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-03-04 10:54:04,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-03-04 10:54:04,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:54:04,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:54:04,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 10:54:04,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:54:05,538 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 10:54:05,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:54:05,936 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 10:54:05,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:54:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493818327] [2025-03-04 10:54:05,936 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 10:54:05,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [510974228] [2025-03-04 10:54:05,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [510974228] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:54:05,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:54:05,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2025-03-04 10:54:05,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317769060] [2025-03-04 10:54:05,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:54:05,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 10:54:05,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:54:05,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 10:54:05,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:54:05,939 INFO L87 Difference]: Start difference. First operand 237 states and 248 transitions. Second operand has 16 states, 15 states have (on average 26.933333333333334) internal successors, (404), 16 states have internal predecessors, (404), 6 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-04 10:54:06,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:54:06,255 INFO L93 Difference]: Finished difference Result 237 states and 248 transitions. [2025-03-04 10:54:06,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:54:06,256 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 26.933333333333334) internal successors, (404), 16 states have internal predecessors, (404), 6 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) Word has length 276 [2025-03-04 10:54:06,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:54:06,256 INFO L225 Difference]: With dead ends: 237 [2025-03-04 10:54:06,256 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:54:06,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 550 GetRequests, 536 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2025-03-04 10:54:06,257 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 6 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:54:06,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 678 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1090 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:54:06,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:54:06,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:54:06,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:54:06,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:54:06,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 276 [2025-03-04 10:54:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:54:06,257 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:54:06,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 26.933333333333334) internal successors, (404), 16 states have internal predecessors, (404), 6 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 6 states have call predecessors, (30), 6 states have call successors, (30) [2025-03-04 10:54:06,258 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:54:06,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:54:06,259 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 140 remaining) [2025-03-04 10:54:06,260 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 140 remaining) [2025-03-04 10:54:06,261 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 140 remaining) [2025-03-04 10:54:06,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 140 remaining) [2025-03-04 10:54:06,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 140 remaining) [2025-03-04 10:54:06,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 140 remaining) [2025-03-04 10:54:06,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr104ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr105ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr106ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr107ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr108ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr109ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr110ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr111ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr112ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr113ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr114ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr115ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr116ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr117ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr118ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr119ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr120ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr121ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr122ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr123ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 140 remaining) [2025-03-04 10:54:06,266 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr124ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr125ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr126ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr127ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr128ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr129ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr130ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr131ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr132ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr133ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr134ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr135ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr136ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr137ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr138ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 140 remaining) [2025-03-04 10:54:06,267 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr139ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 140 remaining) [2025-03-04 10:54:06,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2025-03-04 10:54:06,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 10:54:06,470 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:54:06,471 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:54:07,436 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:54:07,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:54:07 BoogieIcfgContainer [2025-03-04 10:54:07,446 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:54:07,446 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:54:07,446 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:54:07,446 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:54:07,447 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:52:55" (3/4) ... [2025-03-04 10:54:07,448 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:54:07,452 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2025-03-04 10:54:07,457 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 10:54:07,457 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 10:54:07,457 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:54:07,458 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:54:07,528 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:54:07,528 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:54:07,528 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:54:07,529 INFO L158 Benchmark]: Toolchain (without parser) took 72434.87ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 110.4MB in the beginning and 232.2MB in the end (delta: -121.9MB). Peak memory consumption was 155.0MB. Max. memory is 16.1GB. [2025-03-04 10:54:07,529 INFO L158 Benchmark]: CDTParser took 1.11ms. Allocated memory is still 201.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:54:07,529 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.74ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:54:07,529 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.87ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:54:07,529 INFO L158 Benchmark]: Boogie Preprocessor took 23.74ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 94.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:54:07,529 INFO L158 Benchmark]: IcfgBuilder took 654.36ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 56.1MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 10:54:07,530 INFO L158 Benchmark]: TraceAbstraction took 71471.67ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 56.1MB in the beginning and 240.4MB in the end (delta: -184.3MB). Peak memory consumption was 199.4MB. Max. memory is 16.1GB. [2025-03-04 10:54:07,530 INFO L158 Benchmark]: Witness Printer took 82.04ms. Allocated memory is still 419.4MB. Free memory was 240.4MB in the beginning and 232.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:54:07,530 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11ms. Allocated memory is still 201.3MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.74ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 98.3MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.87ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.74ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 94.9MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 654.36ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 56.1MB in the end (delta: 38.8MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 71471.67ms. Allocated memory was 142.6MB in the beginning and 419.4MB in the end (delta: 276.8MB). Free memory was 56.1MB in the beginning and 240.4MB in the end (delta: -184.3MB). Peak memory consumption was 199.4MB. Max. memory is 16.1GB. * Witness Printer took 82.04ms. Allocated memory is still 419.4MB. Free memory was 240.4MB in the beginning and 232.2MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 53]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 52]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 51]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 50]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 48]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 45]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 44]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 43]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 42]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 38]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 35]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 34]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 306 locations, 140 error locations. Started 1 CEGAR loops. OverallTime: 70.4s, OverallIterations: 39, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 43.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 9471 SdHoareTripleChecker+Valid, 41.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9235 mSDsluCounter, 24269 SdHoareTripleChecker+Invalid, 39.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15478 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28761 IncrementalHoareTripleChecker+Invalid, 29372 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 8791 mSDtfsCounter, 28761 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 5718 GetRequests, 5455 SyntacticMatches, 9 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=724occurred in iteration=35, InterpolantAutomatonStates: 247, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 39 MinimizatonAttempts, 1546 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 8234 NumberOfCodeBlocks, 8234 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 7328 ConstructedInterpolants, 9 QuantifiedInterpolants, 48968 SizeOfPredicates, 34 NumberOfNonLiveVariables, 5707 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 59 InterpolantComputations, 21 PerfectInterpolantSequences, 7707/9012 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 140 specifications checked. All of them hold - InvariantResult [Line: 33]: Location Invariant Derived location invariant: (((((((((7 == y) && (z == 12)) && (x == 1)) && (n == 1)) && (0 <= a)) && (counter == 1)) && (a <= 32767)) || ((((((y == 1) && (counter == 0)) && ((((a + 1) <= 0) && (0 <= (a + 32768))) || ((0 <= a) && (a <= 32767)))) && (n == 0)) && (x == 0)) && (6 == z))) || ((((((((n <= 357913941) && (1 <= a)) && (x == 8)) && (1 <= n)) && (19 == y)) && (counter == 2)) && (a <= 32767)) && (z == 18))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:54:07,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE