./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i --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/uthash-2.0.2/uthash_JEN_nondet_test1-1.i -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 fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 14:53:25,084 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 14:53:25,135 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 14:53:25,139 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 14:53:25,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 14:53:25,161 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 14:53:25,162 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 14:53:25,162 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 14:53:25,162 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 14:53:25,163 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 14:53:25,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 14:53:25,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 14:53:25,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 14:53:25,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 14:53:25,163 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 14:53:25,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 14:53:25,164 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 14:53:25,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:53:25,165 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 14:53:25,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 14:53:25,165 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 -> fdc85b042221b41aa26e62667e19ce1f6c246be9a2cb4f81fe8b15c8429db160 [2025-03-04 14:53:25,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 14:53:25,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 14:53:25,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 14:53:25,398 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 14:53:25,398 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 14:53:25,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2025-03-04 14:53:26,521 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8725bd8e2/7a8b0f1bf43440d8a2e0329ae2af8cba/FLAG82561776d [2025-03-04 14:53:26,777 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 14:53:26,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_nondet_test1-1.i [2025-03-04 14:53:26,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8725bd8e2/7a8b0f1bf43440d8a2e0329ae2af8cba/FLAG82561776d [2025-03-04 14:53:26,801 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8725bd8e2/7a8b0f1bf43440d8a2e0329ae2af8cba [2025-03-04 14:53:26,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 14:53:26,804 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 14:53:26,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 14:53:26,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 14:53:26,808 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 14:53:26,808 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:53:26" (1/1) ... [2025-03-04 14:53:26,809 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a220e21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:26, skipping insertion in model container [2025-03-04 14:53:26,809 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:53:26" (1/1) ... [2025-03-04 14:53:26,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 14:53:27,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:53:27,154 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 14:53:27,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 14:53:27,245 INFO L204 MainTranslator]: Completed translation [2025-03-04 14:53:27,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27 WrapperNode [2025-03-04 14:53:27,246 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 14:53:27,247 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 14:53:27,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 14:53:27,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 14:53:27,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,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 02:53:27" (1/1) ... [2025-03-04 14:53:27,288 INFO L138 Inliner]: procedures = 176, calls = 170, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 779 [2025-03-04 14:53:27,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 14:53:27,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 14:53:27,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 14:53:27,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 14:53:27,297 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,334 INFO L175 MemorySlicer]: Split 158 memory accesses to 2 slices as follows [2, 156]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2025-03-04 14:53:27,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,364 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,366 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,368 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,370 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 14:53:27,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 14:53:27,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 14:53:27,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 14:53:27,374 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (1/1) ... [2025-03-04 14:53:27,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 14:53:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:27,402 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 14:53:27,406 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 14:53:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 14:53:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 14:53:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 14:53:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 14:53:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 14:53:27,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 14:53:27,426 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 14:53:27,426 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 14:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 14:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 14:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 14:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 14:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 14:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 14:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 14:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 14:53:27,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 14:53:27,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 14:53:27,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 14:53:27,554 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 14:53:27,555 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 14:53:28,306 INFO L? ?]: Removed 205 outVars from TransFormulas that were not future-live. [2025-03-04 14:53:28,306 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 14:53:28,333 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 14:53:28,333 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 14:53:28,334 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:53:28 BoogieIcfgContainer [2025-03-04 14:53:28,334 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 14:53:28,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 14:53:28,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 14:53:28,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 14:53:28,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:53:26" (1/3) ... [2025-03-04 14:53:28,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd61223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:53:28, skipping insertion in model container [2025-03-04 14:53:28,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:53:27" (2/3) ... [2025-03-04 14:53:28,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bd61223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:53:28, skipping insertion in model container [2025-03-04 14:53:28,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:53:28" (3/3) ... [2025-03-04 14:53:28,340 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_JEN_nondet_test1-1.i [2025-03-04 14:53:28,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 14:53:28,351 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_JEN_nondet_test1-1.i that has 3 procedures, 221 locations, 1 initial locations, 19 loop locations, and 6 error locations. [2025-03-04 14:53:28,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 14:53:28,410 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;@43678be7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 14:53:28,410 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 14:53:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 206 states have (on average 1.6116504854368932) internal successors, (332), 212 states have internal predecessors, (332), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 14:53:28,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 14:53:28,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:28,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 14:53:28,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:28,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:28,425 INFO L85 PathProgramCache]: Analyzing trace with hash 373720117, now seen corresponding path program 1 times [2025-03-04 14:53:28,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:28,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956414881] [2025-03-04 14:53:28,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:28,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:28,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 14:53:28,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 14:53:28,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:28,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:28,549 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 14:53:28,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:28,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956414881] [2025-03-04 14:53:28,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956414881] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:28,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:28,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:53:28,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481380397] [2025-03-04 14:53:28,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:28,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:53:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:28,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:53:28,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:53:28,571 INFO L87 Difference]: Start difference. First operand has 217 states, 206 states have (on average 1.6116504854368932) internal successors, (332), 212 states have internal predecessors, (332), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 14:53:28,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:28,722 INFO L93 Difference]: Finished difference Result 626 states and 987 transitions. [2025-03-04 14:53:28,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:53:28,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-04 14:53:28,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:28,730 INFO L225 Difference]: With dead ends: 626 [2025-03-04 14:53:28,731 INFO L226 Difference]: Without dead ends: 405 [2025-03-04 14:53:28,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:53:28,736 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 275 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:28,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 554 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:53:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-04 14:53:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 211. [2025-03-04 14:53:28,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 201 states have (on average 1.4577114427860696) internal successors, (293), 206 states have internal predecessors, (293), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 14:53:28,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 299 transitions. [2025-03-04 14:53:28,787 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 299 transitions. Word has length 5 [2025-03-04 14:53:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:28,788 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 299 transitions. [2025-03-04 14:53:28,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 14:53:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 299 transitions. [2025-03-04 14:53:28,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 14:53:28,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:28,790 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 14:53:28,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 14:53:28,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:28,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1289173282, now seen corresponding path program 1 times [2025-03-04 14:53:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:28,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953749360] [2025-03-04 14:53:28,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:28,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 14:53:28,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 14:53:28,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:28,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:28,990 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 14:53:28,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:28,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953749360] [2025-03-04 14:53:28,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953749360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:28,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:28,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:53:28,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435345946] [2025-03-04 14:53:28,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:28,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:53:28,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:28,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:53:28,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:53:28,993 INFO L87 Difference]: Start difference. First operand 211 states and 299 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 14:53:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:29,081 INFO L93 Difference]: Finished difference Result 216 states and 305 transitions. [2025-03-04 14:53:29,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:53:29,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2025-03-04 14:53:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:29,083 INFO L225 Difference]: With dead ends: 216 [2025-03-04 14:53:29,083 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 14:53:29,083 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 14:53:29,084 INFO L435 NwaCegarLoop]: 273 mSDtfsCounter, 1 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:29,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 806 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:53:29,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 14:53:29,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 214. [2025-03-04 14:53:29,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 204 states have (on average 1.4509803921568627) internal successors, (296), 209 states have internal predecessors, (296), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 14:53:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 302 transitions. [2025-03-04 14:53:29,100 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 302 transitions. Word has length 6 [2025-03-04 14:53:29,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:29,101 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 302 transitions. [2025-03-04 14:53:29,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 14:53:29,101 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 302 transitions. [2025-03-04 14:53:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-04 14:53:29,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:29,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:29,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 14:53:29,102 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:29,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:29,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1309665755, now seen corresponding path program 1 times [2025-03-04 14:53:29,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:29,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510026775] [2025-03-04 14:53:29,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:29,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:29,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 14:53:29,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 14:53:29,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:29,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:29,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 14:53:29,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:29,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510026775] [2025-03-04 14:53:29,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510026775] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:29,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:29,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:53:29,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788000570] [2025-03-04 14:53:29,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:29,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:53:29,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:29,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:53:29,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:53:29,194 INFO L87 Difference]: Start difference. First operand 214 states and 302 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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 14:53:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:29,243 INFO L93 Difference]: Finished difference Result 216 states and 304 transitions. [2025-03-04 14:53:29,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:53:29,243 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 14:53:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:29,244 INFO L225 Difference]: With dead ends: 216 [2025-03-04 14:53:29,245 INFO L226 Difference]: Without dead ends: 215 [2025-03-04 14:53:29,245 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 14:53:29,245 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 0 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:29,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 543 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:53:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2025-03-04 14:53:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2025-03-04 14:53:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.448780487804878) internal successors, (297), 210 states have internal predecessors, (297), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 14:53:29,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions. [2025-03-04 14:53:29,258 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 7 [2025-03-04 14:53:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:29,258 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 303 transitions. [2025-03-04 14:53:29,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 14:53:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions. [2025-03-04 14:53:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 14:53:29,261 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:29,261 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:29,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 14:53:29,262 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:29,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash 279899245, now seen corresponding path program 1 times [2025-03-04 14:53:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:29,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048195310] [2025-03-04 14:53:29,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:29,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 14:53:29,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 14:53:29,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:29,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:29,486 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 14:53:29,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:29,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048195310] [2025-03-04 14:53:29,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048195310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:29,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:29,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 14:53:29,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723670496] [2025-03-04 14:53:29,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:29,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:53:29,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:29,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:53:29,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:53:29,487 INFO L87 Difference]: Start difference. First operand 215 states and 303 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 14:53:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:29,587 INFO L93 Difference]: Finished difference Result 426 states and 602 transitions. [2025-03-04 14:53:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:53:29,588 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-03-04 14:53:29,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:29,589 INFO L225 Difference]: With dead ends: 426 [2025-03-04 14:53:29,589 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 14:53:29,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 14:53:29,592 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 105 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:29,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 663 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:53:29,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 14:53:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2025-03-04 14:53:29,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 205 states have (on average 1.4146341463414633) internal successors, (290), 210 states have internal predecessors, (290), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 14:53:29,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 296 transitions. [2025-03-04 14:53:29,602 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 296 transitions. Word has length 78 [2025-03-04 14:53:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:29,602 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 296 transitions. [2025-03-04 14:53:29,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 14:53:29,602 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 296 transitions. [2025-03-04 14:53:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 14:53:29,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:29,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:29,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 14:53:29,604 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:29,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1407422887, now seen corresponding path program 1 times [2025-03-04 14:53:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956422449] [2025-03-04 14:53:29,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:29,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 14:53:29,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 14:53:29,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:29,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:29,751 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 14:53:29,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:29,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956422449] [2025-03-04 14:53:29,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956422449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:29,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:29,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:53:29,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461856559] [2025-03-04 14:53:29,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:29,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 14:53:29,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:29,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 14:53:29,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 14:53:29,752 INFO L87 Difference]: Start difference. First operand 215 states and 296 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 14:53:29,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:29,840 INFO L93 Difference]: Finished difference Result 548 states and 770 transitions. [2025-03-04 14:53:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 14:53:29,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2025-03-04 14:53:29,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:29,843 INFO L225 Difference]: With dead ends: 548 [2025-03-04 14:53:29,844 INFO L226 Difference]: Without dead ends: 340 [2025-03-04 14:53:29,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 14:53:29,846 INFO L435 NwaCegarLoop]: 268 mSDtfsCounter, 134 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:29,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 528 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:53:29,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2025-03-04 14:53:29,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2025-03-04 14:53:29,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 330 states have (on average 1.4363636363636363) internal successors, (474), 335 states have internal predecessors, (474), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 14:53:29,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 480 transitions. [2025-03-04 14:53:29,856 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 480 transitions. Word has length 78 [2025-03-04 14:53:29,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:29,856 INFO L471 AbstractCegarLoop]: Abstraction has 340 states and 480 transitions. [2025-03-04 14:53:29,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 14:53:29,857 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 480 transitions. [2025-03-04 14:53:29,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-04 14:53:29,858 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:29,858 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:29,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 14:53:29,859 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:29,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:29,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1323163530, now seen corresponding path program 1 times [2025-03-04 14:53:29,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:29,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896550383] [2025-03-04 14:53:29,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:29,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:29,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 14:53:29,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 14:53:29,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:29,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:30,100 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:30,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:30,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896550383] [2025-03-04 14:53:30,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896550383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:30,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:30,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:53:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616658063] [2025-03-04 14:53:30,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:30,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:53:30,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:30,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:53:30,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:53:30,104 INFO L87 Difference]: Start difference. First operand 340 states and 480 transitions. Second operand has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:30,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:30,197 INFO L93 Difference]: Finished difference Result 405 states and 565 transitions. [2025-03-04 14:53:30,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:53:30,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2025-03-04 14:53:30,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:30,200 INFO L225 Difference]: With dead ends: 405 [2025-03-04 14:53:30,201 INFO L226 Difference]: Without dead ends: 403 [2025-03-04 14:53:30,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:53:30,202 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 185 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:30,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 787 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:53:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-04 14:53:30,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-04 14:53:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 390 states have (on average 1.412820512820513) internal successors, (551), 395 states have internal predecessors, (551), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 14:53:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 563 transitions. [2025-03-04 14:53:30,219 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 563 transitions. Word has length 93 [2025-03-04 14:53:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:30,219 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 563 transitions. [2025-03-04 14:53:30,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 28.666666666666668) internal successors, (86), 4 states have internal predecessors, (86), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 563 transitions. [2025-03-04 14:53:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 14:53:30,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:30,220 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:53:30,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 14:53:30,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:30,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:30,221 INFO L85 PathProgramCache]: Analyzing trace with hash -429146937, now seen corresponding path program 1 times [2025-03-04 14:53:30,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:30,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135964681] [2025-03-04 14:53:30,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:30,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:30,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:53:30,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:53:30,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:30,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:30,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:30,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135964681] [2025-03-04 14:53:30,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135964681] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:30,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [947638317] [2025-03-04 14:53:30,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:30,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:30,439 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 14:53:30,441 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 14:53:30,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 14:53:30,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 14:53:30,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:30,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:30,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 14:53:30,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:30,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:30,787 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:30,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [947638317] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:30,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:30,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 14:53:30,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251514956] [2025-03-04 14:53:30,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 14:53:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:30,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 14:53:30,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:53:30,944 INFO L87 Difference]: Start difference. First operand 403 states and 563 transitions. Second operand has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 14:53:31,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:31,142 INFO L93 Difference]: Finished difference Result 607 states and 850 transitions. [2025-03-04 14:53:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:53:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 97 [2025-03-04 14:53:31,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:31,145 INFO L225 Difference]: With dead ends: 607 [2025-03-04 14:53:31,146 INFO L226 Difference]: Without dead ends: 601 [2025-03-04 14:53:31,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 14:53:31,146 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 1047 mSDsluCounter, 1674 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 1976 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:31,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 1976 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:53:31,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-04 14:53:31,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 599. [2025-03-04 14:53:31,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 583 states have (on average 1.4133790737564322) internal successors, (824), 588 states have internal predecessors, (824), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-04 14:53:31,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 842 transitions. [2025-03-04 14:53:31,175 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 842 transitions. Word has length 97 [2025-03-04 14:53:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:31,176 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 842 transitions. [2025-03-04 14:53:31,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 14:53:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 842 transitions. [2025-03-04 14:53:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-04 14:53:31,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:31,179 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 14:53:31,187 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 14:53:31,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:31,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:31,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:31,381 INFO L85 PathProgramCache]: Analyzing trace with hash -408248180, now seen corresponding path program 1 times [2025-03-04 14:53:31,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:31,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802392119] [2025-03-04 14:53:31,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:31,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:31,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 14:53:31,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 14:53:31,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:31,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:31,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:31,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802392119] [2025-03-04 14:53:31,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802392119] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:31,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [471817797] [2025-03-04 14:53:31,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:31,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:31,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:31,913 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 14:53:31,914 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 14:53:32,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-04 14:53:32,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-04 14:53:32,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:32,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:32,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 14:53:32,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:32,285 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:32,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:32,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [471817797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:32,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:32,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 14:53:32,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872193470] [2025-03-04 14:53:32,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:32,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:53:32,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:32,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:53:32,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:53:32,433 INFO L87 Difference]: Start difference. First operand 599 states and 842 transitions. Second operand has 13 states, 12 states have (on average 15.5) internal successors, (186), 13 states have internal predecessors, (186), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:32,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:32,674 INFO L93 Difference]: Finished difference Result 805 states and 1133 transitions. [2025-03-04 14:53:32,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 14:53:32,674 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.5) internal successors, (186), 13 states have internal predecessors, (186), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 98 [2025-03-04 14:53:32,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:32,677 INFO L225 Difference]: With dead ends: 805 [2025-03-04 14:53:32,678 INFO L226 Difference]: Without dead ends: 804 [2025-03-04 14:53:32,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-04 14:53:32,678 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 980 mSDsluCounter, 1932 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 2233 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:32,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 2233 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:53:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-04 14:53:32,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 797. [2025-03-04 14:53:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 778 states have (on average 1.4125964010282777) internal successors, (1099), 783 states have internal predecessors, (1099), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:53:32,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1123 transitions. [2025-03-04 14:53:32,698 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1123 transitions. Word has length 98 [2025-03-04 14:53:32,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:32,698 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1123 transitions. [2025-03-04 14:53:32,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.5) internal successors, (186), 13 states have internal predecessors, (186), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:32,698 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1123 transitions. [2025-03-04 14:53:32,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-04 14:53:32,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:32,699 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-04 14:53:32,707 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 14:53:32,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-04 14:53:32,900 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:32,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:32,900 INFO L85 PathProgramCache]: Analyzing trace with hash 229208631, now seen corresponding path program 1 times [2025-03-04 14:53:32,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:32,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3749829] [2025-03-04 14:53:32,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:32,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:32,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 14:53:32,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 14:53:32,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:32,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:33,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:33,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3749829] [2025-03-04 14:53:33,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3749829] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:33,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530812844] [2025-03-04 14:53:33,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:33,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:33,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:33,332 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 14:53:33,334 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 14:53:33,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-04 14:53:33,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-04 14:53:33,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:33,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:33,546 INFO L256 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 14:53:33,551 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:33,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:33,821 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:33,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530812844] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:33,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:33,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-03-04 14:53:33,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881164069] [2025-03-04 14:53:33,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:33,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 14:53:33,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:33,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 14:53:33,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=96, Unknown=0, NotChecked=0, Total=156 [2025-03-04 14:53:33,822 INFO L87 Difference]: Start difference. First operand 797 states and 1123 transitions. Second operand has 13 states, 12 states have (on average 15.75) internal successors, (189), 13 states have internal predecessors, (189), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:34,069 INFO L93 Difference]: Finished difference Result 805 states and 1130 transitions. [2025-03-04 14:53:34,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 14:53:34,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 15.75) internal successors, (189), 13 states have internal predecessors, (189), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 99 [2025-03-04 14:53:34,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:34,073 INFO L225 Difference]: With dead ends: 805 [2025-03-04 14:53:34,073 INFO L226 Difference]: Without dead ends: 804 [2025-03-04 14:53:34,073 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2025-03-04 14:53:34,073 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 794 mSDsluCounter, 1881 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2183 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:34,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2183 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 14:53:34,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-03-04 14:53:34,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 798. [2025-03-04 14:53:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 779 states have (on average 1.4094993581514763) internal successors, (1098), 784 states have internal predecessors, (1098), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:53:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1122 transitions. [2025-03-04 14:53:34,095 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1122 transitions. Word has length 99 [2025-03-04 14:53:34,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:34,095 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1122 transitions. [2025-03-04 14:53:34,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 15.75) internal successors, (189), 13 states have internal predecessors, (189), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:34,096 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1122 transitions. [2025-03-04 14:53:34,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-04 14:53:34,098 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:34,098 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 14:53:34,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 14:53:34,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:34,299 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:34,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1347120469, now seen corresponding path program 1 times [2025-03-04 14:53:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:34,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353610597] [2025-03-04 14:53:34,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:34,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:34,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 14:53:34,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 14:53:34,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:34,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:34,577 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:34,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353610597] [2025-03-04 14:53:34,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353610597] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:34,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340128483] [2025-03-04 14:53:34,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:34,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:34,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:34,579 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 14:53:34,581 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 14:53:34,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-04 14:53:34,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-04 14:53:34,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:34,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:34,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 915 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 14:53:34,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:35,040 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:35,040 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 14:53:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340128483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:35,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 14:53:35,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 14:53:35,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216841063] [2025-03-04 14:53:35,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:35,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:53:35,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:35,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:53:35,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:53:35,042 INFO L87 Difference]: Start difference. First operand 798 states and 1122 transitions. Second operand has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:35,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:35,162 INFO L93 Difference]: Finished difference Result 798 states and 1122 transitions. [2025-03-04 14:53:35,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:53:35,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 170 [2025-03-04 14:53:35,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:35,165 INFO L225 Difference]: With dead ends: 798 [2025-03-04 14:53:35,165 INFO L226 Difference]: Without dead ends: 797 [2025-03-04 14:53:35,165 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 14:53:35,166 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 379 mSDsluCounter, 1203 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1670 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:35,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1670 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 14:53:35,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2025-03-04 14:53:35,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2025-03-04 14:53:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 797 states, 779 states have (on average 1.4056482670089858) internal successors, (1095), 783 states have internal predecessors, (1095), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:53:35,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1119 transitions. [2025-03-04 14:53:35,188 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1119 transitions. Word has length 170 [2025-03-04 14:53:35,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:35,188 INFO L471 AbstractCegarLoop]: Abstraction has 797 states and 1119 transitions. [2025-03-04 14:53:35,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 32.6) internal successors, (163), 6 states have internal predecessors, (163), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:35,188 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1119 transitions. [2025-03-04 14:53:35,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2025-03-04 14:53:35,192 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:35,192 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:35,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 14:53:35,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:35,393 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:35,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:35,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2116521009, now seen corresponding path program 1 times [2025-03-04 14:53:35,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:35,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924848747] [2025-03-04 14:53:35,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:35,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:35,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-04 14:53:35,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-04 14:53:35,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:35,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:35,641 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-04 14:53:35,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:35,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924848747] [2025-03-04 14:53:35,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924848747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:35,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:35,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 14:53:35,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614668031] [2025-03-04 14:53:35,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:35,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 14:53:35,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:35,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 14:53:35,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:53:35,643 INFO L87 Difference]: Start difference. First operand 797 states and 1119 transitions. Second operand has 4 states, 3 states have (on average 55.666666666666664) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:35,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:35,710 INFO L93 Difference]: Finished difference Result 797 states and 1119 transitions. [2025-03-04 14:53:35,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 14:53:35,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 55.666666666666664) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 248 [2025-03-04 14:53:35,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:35,713 INFO L225 Difference]: With dead ends: 797 [2025-03-04 14:53:35,714 INFO L226 Difference]: Without dead ends: 796 [2025-03-04 14:53:35,714 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 14:53:35,714 INFO L435 NwaCegarLoop]: 262 mSDtfsCounter, 194 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:35,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 536 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 14:53:35,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-04 14:53:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 796. [2025-03-04 14:53:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 796 states, 779 states have (on average 1.4030808729139923) internal successors, (1093), 782 states have internal predecessors, (1093), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 14:53:35,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1117 transitions. [2025-03-04 14:53:35,733 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1117 transitions. Word has length 248 [2025-03-04 14:53:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:35,733 INFO L471 AbstractCegarLoop]: Abstraction has 796 states and 1117 transitions. [2025-03-04 14:53:35,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 55.666666666666664) internal successors, (167), 4 states have internal predecessors, (167), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1117 transitions. [2025-03-04 14:53:35,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2025-03-04 14:53:35,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:35,735 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:35,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 14:53:35,736 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:35,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:35,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1137485479, now seen corresponding path program 1 times [2025-03-04 14:53:35,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:35,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116457933] [2025-03-04 14:53:35,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:35,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:35,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 14:53:35,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 14:53:35,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:35,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:36,214 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:36,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:36,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116457933] [2025-03-04 14:53:36,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116457933] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:36,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212398653] [2025-03-04 14:53:36,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:36,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:36,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:36,219 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 14:53:36,221 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 14:53:36,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 251 statements into 1 equivalence classes. [2025-03-04 14:53:36,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 251 of 251 statements. [2025-03-04 14:53:36,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:36,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:36,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 1303 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 14:53:36,599 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:36,825 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 230 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212398653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:37,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:37,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 14:53:37,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148008581] [2025-03-04 14:53:37,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:37,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 14:53:37,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:37,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 14:53:37,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 14:53:37,103 INFO L87 Difference]: Start difference. First operand 796 states and 1117 transitions. Second operand has 18 states, 18 states have (on average 31.38888888888889) internal successors, (565), 18 states have internal predecessors, (565), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 14:53:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:37,432 INFO L93 Difference]: Finished difference Result 1386 states and 1950 transitions. [2025-03-04 14:53:37,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 14:53:37,432 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 31.38888888888889) internal successors, (565), 18 states have internal predecessors, (565), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 251 [2025-03-04 14:53:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:37,437 INFO L225 Difference]: With dead ends: 1386 [2025-03-04 14:53:37,437 INFO L226 Difference]: Without dead ends: 1381 [2025-03-04 14:53:37,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 14:53:37,438 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 2434 mSDsluCounter, 2626 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 2966 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:37,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 2966 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:53:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2025-03-04 14:53:37,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1377. [2025-03-04 14:53:37,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1351 states have (on average 1.4056254626202813) internal successors, (1899), 1354 states have internal predecessors, (1899), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-04 14:53:37,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1941 transitions. [2025-03-04 14:53:37,467 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1941 transitions. Word has length 251 [2025-03-04 14:53:37,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:37,467 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1941 transitions. [2025-03-04 14:53:37,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 31.38888888888889) internal successors, (565), 18 states have internal predecessors, (565), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 14:53:37,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1941 transitions. [2025-03-04 14:53:37,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-03-04 14:53:37,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:37,471 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:37,480 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 14:53:37,676 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,SelfDestructingSolverStorable11 [2025-03-04 14:53:37,677 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:37,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1490543743, now seen corresponding path program 1 times [2025-03-04 14:53:37,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:37,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216241418] [2025-03-04 14:53:37,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:37,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:37,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 14:53:37,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 14:53:37,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:37,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:39,580 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:39,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:39,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216241418] [2025-03-04 14:53:39,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216241418] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:39,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824079116] [2025-03-04 14:53:39,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:39,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:39,583 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 14:53:39,584 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 14:53:39,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-03-04 14:53:40,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-03-04 14:53:40,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:40,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:40,058 INFO L256 TraceCheckSpWp]: Trace formula consists of 1711 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 14:53:40,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:40,469 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:40,469 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 0 proven. 472 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:40,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824079116] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:40,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:40,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-04 14:53:40,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92738718] [2025-03-04 14:53:40,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:40,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 14:53:40,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:40,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 14:53:40,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-03-04 14:53:40,860 INFO L87 Difference]: Start difference. First operand 1377 states and 1941 transitions. Second operand has 28 states, 27 states have (on average 24.333333333333332) internal successors, (657), 28 states have internal predecessors, (657), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:41,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:41,385 INFO L93 Difference]: Finished difference Result 1976 states and 2796 transitions. [2025-03-04 14:53:41,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 14:53:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.333333333333332) internal successors, (657), 28 states have internal predecessors, (657), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 329 [2025-03-04 14:53:41,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:41,393 INFO L225 Difference]: With dead ends: 1976 [2025-03-04 14:53:41,394 INFO L226 Difference]: Without dead ends: 1975 [2025-03-04 14:53:41,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 672 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 14:53:41,395 INFO L435 NwaCegarLoop]: 299 mSDtfsCounter, 2768 mSDsluCounter, 4059 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2791 SdHoareTripleChecker+Valid, 4358 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:41,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2791 Valid, 4358 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:53:41,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-03-04 14:53:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1965. [2025-03-04 14:53:41,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1930 states have (on average 1.405699481865285) internal successors, (2713), 1933 states have internal predecessors, (2713), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 14:53:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2773 transitions. [2025-03-04 14:53:41,431 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2773 transitions. Word has length 329 [2025-03-04 14:53:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:41,432 INFO L471 AbstractCegarLoop]: Abstraction has 1965 states and 2773 transitions. [2025-03-04 14:53:41,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.333333333333332) internal successors, (657), 28 states have internal predecessors, (657), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2773 transitions. [2025-03-04 14:53:41,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-03-04 14:53:41,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:41,435 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:41,444 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 14:53:41,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:41,639 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:41,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:41,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1037784546, now seen corresponding path program 1 times [2025-03-04 14:53:41,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:41,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971074648] [2025-03-04 14:53:41,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:41,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:41,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-04 14:53:41,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-04 14:53:41,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:41,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:43,245 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:43,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:43,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971074648] [2025-03-04 14:53:43,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971074648] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:43,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498589588] [2025-03-04 14:53:43,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:43,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:43,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:43,249 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 14:53:43,250 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 14:53:43,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-03-04 14:53:43,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-03-04 14:53:43,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:43,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:43,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1712 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 14:53:43,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:44,094 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:44,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 476 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:44,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498589588] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:44,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:44,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-03-04 14:53:44,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602775006] [2025-03-04 14:53:44,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:44,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 14:53:44,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:44,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 14:53:44,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=498, Unknown=0, NotChecked=0, Total=756 [2025-03-04 14:53:44,400 INFO L87 Difference]: Start difference. First operand 1965 states and 2773 transitions. Second operand has 28 states, 27 states have (on average 24.444444444444443) internal successors, (660), 28 states have internal predecessors, (660), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:44,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:44,922 INFO L93 Difference]: Finished difference Result 1976 states and 2790 transitions. [2025-03-04 14:53:44,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 14:53:44,923 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 24.444444444444443) internal successors, (660), 28 states have internal predecessors, (660), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 330 [2025-03-04 14:53:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:44,929 INFO L225 Difference]: With dead ends: 1976 [2025-03-04 14:53:44,929 INFO L226 Difference]: Without dead ends: 1975 [2025-03-04 14:53:44,930 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 674 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=338, Invalid=718, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 14:53:44,930 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 3306 mSDsluCounter, 4355 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3329 SdHoareTripleChecker+Valid, 4616 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:44,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3329 Valid, 4616 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:53:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1975 states. [2025-03-04 14:53:44,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1975 to 1966. [2025-03-04 14:53:44,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1931 states have (on average 1.402900051786639) internal successors, (2709), 1934 states have internal predecessors, (2709), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 14:53:44,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2769 transitions. [2025-03-04 14:53:44,967 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2769 transitions. Word has length 330 [2025-03-04 14:53:44,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:44,967 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 2769 transitions. [2025-03-04 14:53:44,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 24.444444444444443) internal successors, (660), 28 states have internal predecessors, (660), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 14:53:44,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2769 transitions. [2025-03-04 14:53:44,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-03-04 14:53:44,974 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:44,974 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:44,984 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 14:53:45,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:45,180 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:45,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:45,180 INFO L85 PathProgramCache]: Analyzing trace with hash 447394407, now seen corresponding path program 2 times [2025-03-04 14:53:45,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:45,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42124117] [2025-03-04 14:53:45,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:53:45,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:45,299 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 559 statements into 2 equivalence classes. [2025-03-04 14:53:45,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 559 of 559 statements. [2025-03-04 14:53:45,397 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:53:45,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42124117] [2025-03-04 14:53:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42124117] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 14:53:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665386996] [2025-03-04 14:53:46,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 14:53:46,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 14:53:46,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 14:53:46,452 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 14:53:46,453 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 14:53:46,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 559 statements into 2 equivalence classes. [2025-03-04 14:53:47,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 559 of 559 statements. [2025-03-04 14:53:47,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 14:53:47,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:47,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 2807 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 14:53:47,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 14:53:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:47,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 14:53:47,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1616 backedges. 0 proven. 1612 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 14:53:47,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665386996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 14:53:47,895 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 14:53:47,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 14:53:47,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98007423] [2025-03-04 14:53:47,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 14:53:47,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 14:53:47,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:47,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 14:53:47,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 14:53:47,897 INFO L87 Difference]: Start difference. First operand 1966 states and 2769 transitions. Second operand has 23 states, 23 states have (on average 34.73913043478261) internal successors, (799), 23 states have internal predecessors, (799), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 14:53:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:48,264 INFO L93 Difference]: Finished difference Result 1971 states and 2774 transitions. [2025-03-04 14:53:48,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 14:53:48,264 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 34.73913043478261) internal successors, (799), 23 states have internal predecessors, (799), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 559 [2025-03-04 14:53:48,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:48,270 INFO L225 Difference]: With dead ends: 1971 [2025-03-04 14:53:48,270 INFO L226 Difference]: Without dead ends: 1966 [2025-03-04 14:53:48,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1133 GetRequests, 1101 SyntacticMatches, 11 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 14:53:48,270 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 5515 mSDsluCounter, 3207 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5541 SdHoareTripleChecker+Valid, 3625 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:48,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5541 Valid, 3625 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:53:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1966 states. [2025-03-04 14:53:48,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1966 to 1966. [2025-03-04 14:53:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1966 states, 1931 states have (on average 1.4013464526152253) internal successors, (2706), 1934 states have internal predecessors, (2706), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 14:53:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1966 states to 1966 states and 2766 transitions. [2025-03-04 14:53:48,301 INFO L78 Accepts]: Start accepts. Automaton has 1966 states and 2766 transitions. Word has length 559 [2025-03-04 14:53:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:48,302 INFO L471 AbstractCegarLoop]: Abstraction has 1966 states and 2766 transitions. [2025-03-04 14:53:48,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 34.73913043478261) internal successors, (799), 23 states have internal predecessors, (799), 3 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-04 14:53:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1966 states and 2766 transitions. [2025-03-04 14:53:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2025-03-04 14:53:48,314 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:48,314 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:48,325 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 14:53:48,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 14:53:48,515 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:48,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:48,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1713210770, now seen corresponding path program 3 times [2025-03-04 14:53:48,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:48,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579281850] [2025-03-04 14:53:48,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 14:53:48,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:48,663 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 790 statements into 12 equivalence classes. [2025-03-04 14:53:48,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 82 of 790 statements. [2025-03-04 14:53:48,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 14:53:48,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 3461 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 2823 trivial. 0 not checked. [2025-03-04 14:53:48,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579281850] [2025-03-04 14:53:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579281850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:48,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:48,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:53:48,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484085589] [2025-03-04 14:53:48,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:48,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:53:48,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:48,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:53:48,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:53:48,901 INFO L87 Difference]: Start difference. First operand 1966 states and 2766 transitions. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:49,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:49,350 INFO L93 Difference]: Finished difference Result 4187 states and 5862 transitions. [2025-03-04 14:53:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:53:49,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 790 [2025-03-04 14:53:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:49,357 INFO L225 Difference]: With dead ends: 4187 [2025-03-04 14:53:49,357 INFO L226 Difference]: Without dead ends: 2306 [2025-03-04 14:53:49,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:53:49,359 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 13 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:49,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 792 Invalid, 654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 14:53:49,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2025-03-04 14:53:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2266. [2025-03-04 14:53:49,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2266 states, 2231 states have (on average 1.3787539220080682) internal successors, (3076), 2234 states have internal predecessors, (3076), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 14:53:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 3136 transitions. [2025-03-04 14:53:49,399 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 3136 transitions. Word has length 790 [2025-03-04 14:53:49,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:49,399 INFO L471 AbstractCegarLoop]: Abstraction has 2266 states and 3136 transitions. [2025-03-04 14:53:49,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 3136 transitions. [2025-03-04 14:53:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 801 [2025-03-04 14:53:49,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:49,406 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:49,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 14:53:49,406 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:49,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1962984658, now seen corresponding path program 1 times [2025-03-04 14:53:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:49,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153838748] [2025-03-04 14:53:49,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:49,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:49,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 800 statements into 1 equivalence classes. [2025-03-04 14:53:49,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 800 of 800 statements. [2025-03-04 14:53:49,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:49,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3506 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 3172 trivial. 0 not checked. [2025-03-04 14:53:50,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:50,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153838748] [2025-03-04 14:53:50,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153838748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:50,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:50,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 14:53:50,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055865480] [2025-03-04 14:53:50,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:50,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 14:53:50,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:50,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 14:53:50,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:53:50,453 INFO L87 Difference]: Start difference. First operand 2266 states and 3136 transitions. Second operand has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:50,783 INFO L93 Difference]: Finished difference Result 4527 states and 6289 transitions. [2025-03-04 14:53:50,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 14:53:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 800 [2025-03-04 14:53:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:50,788 INFO L225 Difference]: With dead ends: 4527 [2025-03-04 14:53:50,788 INFO L226 Difference]: Without dead ends: 2386 [2025-03-04 14:53:50,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 14:53:50,791 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 14 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:50,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 952 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:53:50,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-04 14:53:50,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2356. [2025-03-04 14:53:50,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2356 states, 2321 states have (on average 1.3813011632916845) internal successors, (3206), 2324 states have internal predecessors, (3206), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 14:53:50,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2356 states to 2356 states and 3266 transitions. [2025-03-04 14:53:50,824 INFO L78 Accepts]: Start accepts. Automaton has 2356 states and 3266 transitions. Word has length 800 [2025-03-04 14:53:50,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:50,824 INFO L471 AbstractCegarLoop]: Abstraction has 2356 states and 3266 transitions. [2025-03-04 14:53:50,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.714285714285715) internal successors, (131), 7 states have internal predecessors, (131), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:50,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2356 states and 3266 transitions. [2025-03-04 14:53:50,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-03-04 14:53:50,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:50,830 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:50,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 14:53:50,830 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:50,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:50,831 INFO L85 PathProgramCache]: Analyzing trace with hash 304453656, now seen corresponding path program 1 times [2025-03-04 14:53:50,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:50,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491844749] [2025-03-04 14:53:50,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:50,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:50,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-03-04 14:53:51,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-03-04 14:53:51,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:51,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:51,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 3226 trivial. 0 not checked. [2025-03-04 14:53:51,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:51,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491844749] [2025-03-04 14:53:51,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491844749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:51,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:51,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 14:53:51,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097452291] [2025-03-04 14:53:51,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:51,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 14:53:51,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:51,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 14:53:51,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:53:51,842 INFO L87 Difference]: Start difference. First operand 2356 states and 3266 transitions. Second operand has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:52,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:52,123 INFO L93 Difference]: Finished difference Result 4615 states and 6407 transitions. [2025-03-04 14:53:52,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 14:53:52,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 810 [2025-03-04 14:53:52,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:52,129 INFO L225 Difference]: With dead ends: 4615 [2025-03-04 14:53:52,129 INFO L226 Difference]: Without dead ends: 2386 [2025-03-04 14:53:52,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 14:53:52,131 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 8 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:52,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 819 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 14:53:52,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2025-03-04 14:53:52,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2025-03-04 14:53:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2351 states have (on average 1.3764355593364526) internal successors, (3236), 2354 states have internal predecessors, (3236), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 14:53:52,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 3296 transitions. [2025-03-04 14:53:52,192 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 3296 transitions. Word has length 810 [2025-03-04 14:53:52,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:52,192 INFO L471 AbstractCegarLoop]: Abstraction has 2386 states and 3296 transitions. [2025-03-04 14:53:52,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.833333333333332) internal successors, (131), 6 states have internal predecessors, (131), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:52,193 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 3296 transitions. [2025-03-04 14:53:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2025-03-04 14:53:52,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:52,201 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:52,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 14:53:52,201 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:52,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:52,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1793139680, now seen corresponding path program 1 times [2025-03-04 14:53:52,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:52,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518975730] [2025-03-04 14:53:52,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:52,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 810 statements into 1 equivalence classes. [2025-03-04 14:53:52,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 810 of 810 statements. [2025-03-04 14:53:52,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 14:53:52,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 14:53:53,873 INFO L134 CoverageAnalysis]: Checked inductivity of 3551 backedges. 361 proven. 0 refuted. 0 times theorem prover too weak. 3190 trivial. 0 not checked. [2025-03-04 14:53:53,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 14:53:53,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518975730] [2025-03-04 14:53:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518975730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 14:53:53,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 14:53:53,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 14:53:53,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882946308] [2025-03-04 14:53:53,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 14:53:53,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 14:53:53,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 14:53:53,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 14:53:53,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 14:53:53,875 INFO L87 Difference]: Start difference. First operand 2386 states and 3296 transitions. Second operand has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 14:53:54,395 INFO L93 Difference]: Finished difference Result 4780 states and 6619 transitions. [2025-03-04 14:53:54,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 14:53:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 810 [2025-03-04 14:53:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 14:53:54,401 INFO L225 Difference]: With dead ends: 4780 [2025-03-04 14:53:54,401 INFO L226 Difference]: Without dead ends: 2526 [2025-03-04 14:53:54,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 14:53:54,404 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 31 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1051 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 1054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 14:53:54,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 1362 Invalid, 1054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1051 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 14:53:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2025-03-04 14:53:54,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2466. [2025-03-04 14:53:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2466 states, 2431 states have (on average 1.37227478403949) internal successors, (3336), 2434 states have internal predecessors, (3336), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 14:53:54,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2466 states to 2466 states and 3396 transitions. [2025-03-04 14:53:54,437 INFO L78 Accepts]: Start accepts. Automaton has 2466 states and 3396 transitions. Word has length 810 [2025-03-04 14:53:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 14:53:54,437 INFO L471 AbstractCegarLoop]: Abstraction has 2466 states and 3396 transitions. [2025-03-04 14:53:54,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 15.0) internal successors, (135), 9 states have internal predecessors, (135), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 14:53:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 2466 states and 3396 transitions. [2025-03-04 14:53:54,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2025-03-04 14:53:54,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 14:53:54,443 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 14:53:54,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 14:53:54,444 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 14:53:54,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 14:53:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash -237235490, now seen corresponding path program 1 times [2025-03-04 14:53:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 14:53:54,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907436333] [2025-03-04 14:53:54,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 14:53:54,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 14:53:54,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 820 statements into 1 equivalence classes.