./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.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 bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:14:38,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:14:38,639 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:14:38,646 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:14:38,647 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:14:38,668 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:14:38,669 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:14:38,669 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:14:38,670 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:14:38,670 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:14:38,671 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:14:38,671 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:14:38,671 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:14:38,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:14:38,671 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:14:38,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:14:38,672 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:14:38,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:14:38,672 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:14:38,673 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:14:38,673 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:14:38,673 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:14:38,673 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:14:38,673 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:14:38,673 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:14:38,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:14:38,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:14:38,673 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:14:38,673 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 -> bd259ad1e1e9b7f6e2ebd2858541cc7ac07d30ed5cbee2b9de70c1db1c5b700e [2025-03-17 19:14:38,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:14:38,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:14:38,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:14:38,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:14:38,954 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:14:38,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2025-03-17 19:14:40,159 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72263917b/455e56741c054100b2f89c2da5db70ca/FLAGc25326f06 [2025-03-17 19:14:40,444 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:14:40,444 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test4-3.i [2025-03-17 19:14:40,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72263917b/455e56741c054100b2f89c2da5db70ca/FLAGc25326f06 [2025-03-17 19:14:40,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72263917b/455e56741c054100b2f89c2da5db70ca [2025-03-17 19:14:40,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:14:40,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:14:40,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:14:40,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:14:40,481 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:14:40,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:14:40" (1/1) ... [2025-03-17 19:14:40,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d10c76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:40, skipping insertion in model container [2025-03-17 19:14:40,482 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:14:40" (1/1) ... [2025-03-17 19:14:40,520 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:14:40,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:14:40,948 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:14:41,062 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:14:41,089 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:14:41,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41 WrapperNode [2025-03-17 19:14:41,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:14:41,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:14:41,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:14:41,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:14:41,096 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,121 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,176 INFO L138 Inliner]: procedures = 176, calls = 435, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1855 [2025-03-17 19:14:41,176 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:14:41,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:14:41,178 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:14:41,178 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:14:41,185 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,328 INFO L175 MemorySlicer]: Split 403 memory accesses to 2 slices as follows [2, 401]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 98 writes are split as follows [0, 98]. [2025-03-17 19:14:41,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,369 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,391 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:14:41,407 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:14:41,407 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:14:41,407 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:14:41,408 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (1/1) ... [2025-03-17 19:14:41,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:14:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:41,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:14:41,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:14:41,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:14:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:14:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-17 19:14:41,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-17 19:14:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:14:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:14:41,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 19:14:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 19:14:41,467 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 19:14:41,467 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 19:14:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:14:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:14:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:14:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:14:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:14:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:14:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:14:41,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:14:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:14:41,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:14:41,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:14:41,666 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:14:41,667 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:14:43,122 INFO L? ?]: Removed 431 outVars from TransFormulas that were not future-live. [2025-03-17 19:14:43,123 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:14:43,178 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:14:43,178 INFO L336 CfgBuilder]: Removed 2 assume(true) statements. [2025-03-17 19:14:43,179 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:14:43 BoogieIcfgContainer [2025-03-17 19:14:43,179 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:14:43,184 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:14:43,184 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:14:43,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:14:43,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:14:40" (1/3) ... [2025-03-17 19:14:43,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628ade43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:14:43, skipping insertion in model container [2025-03-17 19:14:43,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:14:41" (2/3) ... [2025-03-17 19:14:43,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@628ade43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:14:43, skipping insertion in model container [2025-03-17 19:14:43,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:14:43" (3/3) ... [2025-03-17 19:14:43,196 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test4-3.i [2025-03-17 19:14:43,207 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:14:43,209 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_OAT_test4-3.i that has 4 procedures, 489 locations, 1 initial locations, 43 loop locations, and 6 error locations. [2025-03-17 19:14:43,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:14:43,278 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;@48f0bb89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:14:43,279 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 19:14:43,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 485 states, 460 states have (on average 1.6282608695652174) internal successors, (749), 476 states have internal predecessors, (749), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:14:43,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 19:14:43,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:43,290 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 19:14:43,291 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-17 19:14:43,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash 26061128, now seen corresponding path program 1 times [2025-03-17 19:14:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468430184] [2025-03-17 19:14:43,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:43,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:43,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 19:14:43,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 19:14:43,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:43,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:43,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:43,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468430184] [2025-03-17 19:14:43,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468430184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:43,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:43,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:14:43,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472356789] [2025-03-17 19:14:43,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:43,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:14:43,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:43,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:14:43,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:43,475 INFO L87 Difference]: Start difference. First operand has 485 states, 460 states have (on average 1.6282608695652174) internal successors, (749), 476 states have internal predecessors, (749), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:43,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:43,721 INFO L93 Difference]: Finished difference Result 1347 states and 2188 transitions. [2025-03-17 19:14:43,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:14:43,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-17 19:14:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:43,733 INFO L225 Difference]: With dead ends: 1347 [2025-03-17 19:14:43,733 INFO L226 Difference]: Without dead ends: 800 [2025-03-17 19:14:43,740 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:43,742 INFO L435 NwaCegarLoop]: 730 mSDtfsCounter, 541 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1375 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:43,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1375 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:14:43,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-17 19:14:43,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 421. [2025-03-17 19:14:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 398 states have (on average 1.464824120603015) internal successors, (583), 412 states have internal predecessors, (583), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:14:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 615 transitions. [2025-03-17 19:14:43,808 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 615 transitions. Word has length 4 [2025-03-17 19:14:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:43,809 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 615 transitions. [2025-03-17 19:14:43,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:43,809 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 615 transitions. [2025-03-17 19:14:43,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-17 19:14:43,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:43,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-17 19:14:43,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:14:43,810 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:43,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -92351107, now seen corresponding path program 1 times [2025-03-17 19:14:43,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:43,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874463469] [2025-03-17 19:14:43,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:43,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:14:43,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:14:43,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:43,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:14:43,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635874779] [2025-03-17 19:14:43,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:43,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:43,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:43,842 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:43,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:14:43,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-17 19:14:43,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-17 19:14:43,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:43,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:43,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 19:14:43,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:44,009 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:14:44,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:44,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874463469] [2025-03-17 19:14:44,010 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 19:14:44,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635874779] [2025-03-17 19:14:44,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635874779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:44,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:44,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 19:14:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350080839] [2025-03-17 19:14:44,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:44,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:14:44,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:44,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:14:44,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:44,014 INFO L87 Difference]: Start difference. First operand 421 states and 615 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 19:14:44,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:44,164 INFO L93 Difference]: Finished difference Result 801 states and 1169 transitions. [2025-03-17 19:14:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:14:44,165 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 19:14:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:44,169 INFO L225 Difference]: With dead ends: 801 [2025-03-17 19:14:44,169 INFO L226 Difference]: Without dead ends: 800 [2025-03-17 19:14:44,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:44,170 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 537 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:44,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 1174 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:44,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-17 19:14:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 425. [2025-03-17 19:14:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 402 states have (on average 1.4601990049751243) internal successors, (587), 416 states have internal predecessors, (587), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:14:44,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 619 transitions. [2025-03-17 19:14:44,196 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 619 transitions. Word has length 6 [2025-03-17 19:14:44,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:44,197 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 619 transitions. [2025-03-17 19:14:44,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 2 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-17 19:14:44,197 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 619 transitions. [2025-03-17 19:14:44,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 19:14:44,201 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:44,201 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:44,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 19:14:44,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:44,402 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:44,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:44,403 INFO L85 PathProgramCache]: Analyzing trace with hash -343921098, now seen corresponding path program 1 times [2025-03-17 19:14:44,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:44,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656590576] [2025-03-17 19:14:44,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:44,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:44,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 19:14:44,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 19:14:44,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:44,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:45,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:45,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656590576] [2025-03-17 19:14:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656590576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:45,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:45,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 19:14:45,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540670767] [2025-03-17 19:14:45,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:45,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 19:14:45,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:45,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 19:14:45,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:14:45,016 INFO L87 Difference]: Start difference. First operand 425 states and 619 transitions. Second operand has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:45,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:45,196 INFO L93 Difference]: Finished difference Result 847 states and 1235 transitions. [2025-03-17 19:14:45,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:14:45,197 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 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 146 [2025-03-17 19:14:45,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:45,200 INFO L225 Difference]: With dead ends: 847 [2025-03-17 19:14:45,200 INFO L226 Difference]: Without dead ends: 428 [2025-03-17 19:14:45,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:14:45,204 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 108 mSDsluCounter, 1002 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:45,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1545 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:14:45,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-17 19:14:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 425. [2025-03-17 19:14:45,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 402 states have (on average 1.4427860696517414) internal successors, (580), 416 states have internal predecessors, (580), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:14:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 612 transitions. [2025-03-17 19:14:45,239 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 612 transitions. Word has length 146 [2025-03-17 19:14:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:45,239 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 612 transitions. [2025-03-17 19:14:45,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.2) internal successors, (146), 5 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:45,240 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 612 transitions. [2025-03-17 19:14:45,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-17 19:14:45,244 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:45,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:45,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:14:45,245 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-17 19:14:45,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:45,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1367759228, now seen corresponding path program 1 times [2025-03-17 19:14:45,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:45,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065098529] [2025-03-17 19:14:45,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:45,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:45,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-17 19:14:45,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-17 19:14:45,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:45,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:45,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:14:45,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:45,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065098529] [2025-03-17 19:14:45,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065098529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:45,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:45,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:14:45,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272972516] [2025-03-17 19:14:45,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:45,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:14:45,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:45,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:14:45,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:45,461 INFO L87 Difference]: Start difference. First operand 425 states and 612 transitions. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:45,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:45,584 INFO L93 Difference]: Finished difference Result 969 states and 1403 transitions. [2025-03-17 19:14:45,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:14:45,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 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 146 [2025-03-17 19:14:45,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:45,587 INFO L225 Difference]: With dead ends: 969 [2025-03-17 19:14:45,588 INFO L226 Difference]: Without dead ends: 550 [2025-03-17 19:14:45,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:45,590 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 134 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:45,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1117 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:45,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-17 19:14:45,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2025-03-17 19:14:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 527 states have (on average 1.4497153700189753) internal successors, (764), 541 states have internal predecessors, (764), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:14:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 796 transitions. [2025-03-17 19:14:45,618 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 796 transitions. Word has length 146 [2025-03-17 19:14:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:45,619 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 796 transitions. [2025-03-17 19:14:45,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 2 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:14:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 796 transitions. [2025-03-17 19:14:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:14:45,623 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:45,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:45,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:14:45,624 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-17 19:14:45,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:45,624 INFO L85 PathProgramCache]: Analyzing trace with hash 316170086, now seen corresponding path program 1 times [2025-03-17 19:14:45,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:45,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863036865] [2025-03-17 19:14:45,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:45,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:45,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:14:45,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:14:45,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:45,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:45,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:14:45,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:45,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863036865] [2025-03-17 19:14:45,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863036865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:45,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:45,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:14:45,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687354708] [2025-03-17 19:14:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:45,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:14:45,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:45,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:14:45,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:14:45,920 INFO L87 Difference]: Start difference. First operand 550 states and 796 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:14:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:46,049 INFO L93 Difference]: Finished difference Result 972 states and 1405 transitions. [2025-03-17 19:14:46,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:14:46,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 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 161 [2025-03-17 19:14:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:46,052 INFO L225 Difference]: With dead ends: 972 [2025-03-17 19:14:46,052 INFO L226 Difference]: Without dead ends: 553 [2025-03-17 19:14:46,052 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-17 19:14:46,054 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 105 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:46,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1524 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:46,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-17 19:14:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 550. [2025-03-17 19:14:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 527 states have (on average 1.4364326375711576) internal successors, (757), 541 states have internal predecessors, (757), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:14:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 789 transitions. [2025-03-17 19:14:46,076 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 789 transitions. Word has length 161 [2025-03-17 19:14:46,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:46,077 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 789 transitions. [2025-03-17 19:14:46,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:14:46,078 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 789 transitions. [2025-03-17 19:14:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:14:46,079 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:46,079 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:46,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:14:46,080 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-17 19:14:46,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:46,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1069773633, now seen corresponding path program 1 times [2025-03-17 19:14:46,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:46,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140343457] [2025-03-17 19:14:46,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:46,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:46,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:14:46,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:14:46,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:46,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:14:46,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:46,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140343457] [2025-03-17 19:14:46,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140343457] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:46,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:46,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:14:46,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821307220] [2025-03-17 19:14:46,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:46,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:14:46,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:46,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:14:46,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:46,310 INFO L87 Difference]: Start difference. First operand 550 states and 789 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:14:46,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:46,402 INFO L93 Difference]: Finished difference Result 975 states and 1397 transitions. [2025-03-17 19:14:46,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:14:46,402 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 161 [2025-03-17 19:14:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:46,405 INFO L225 Difference]: With dead ends: 975 [2025-03-17 19:14:46,405 INFO L226 Difference]: Without dead ends: 556 [2025-03-17 19:14:46,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:46,406 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:46,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1078 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:46,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-03-17 19:14:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 556. [2025-03-17 19:14:46,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 533 states have (on average 1.4315196998123827) internal successors, (763), 547 states have internal predecessors, (763), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2025-03-17 19:14:46,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 795 transitions. [2025-03-17 19:14:46,425 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 795 transitions. Word has length 161 [2025-03-17 19:14:46,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:46,426 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 795 transitions. [2025-03-17 19:14:46,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:14:46,426 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 795 transitions. [2025-03-17 19:14:46,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-03-17 19:14:46,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:46,428 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:46,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:14:46,428 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:46,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:46,429 INFO L85 PathProgramCache]: Analyzing trace with hash -829233504, now seen corresponding path program 1 times [2025-03-17 19:14:46,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:46,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971371669] [2025-03-17 19:14:46,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:46,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:46,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-03-17 19:14:46,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-03-17 19:14:46,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:46,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:14:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971371669] [2025-03-17 19:14:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971371669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:46,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:14:46,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105159670] [2025-03-17 19:14:46,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:46,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:14:46,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:46,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:14:46,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:14:46,685 INFO L87 Difference]: Start difference. First operand 556 states and 795 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:14:46,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:46,846 INFO L93 Difference]: Finished difference Result 1172 states and 1671 transitions. [2025-03-17 19:14:46,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:14:46,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 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 161 [2025-03-17 19:14:46,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:46,852 INFO L225 Difference]: With dead ends: 1172 [2025-03-17 19:14:46,852 INFO L226 Difference]: Without dead ends: 747 [2025-03-17 19:14:46,853 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-17 19:14:46,854 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 318 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 1102 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:46,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 1102 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:46,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2025-03-17 19:14:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 747. [2025-03-17 19:14:46,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 721 states have (on average 1.4244105409153953) internal successors, (1027), 735 states have internal predecessors, (1027), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 19:14:46,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1065 transitions. [2025-03-17 19:14:46,872 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1065 transitions. Word has length 161 [2025-03-17 19:14:46,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:46,872 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1065 transitions. [2025-03-17 19:14:46,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:14:46,873 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1065 transitions. [2025-03-17 19:14:46,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-03-17 19:14:46,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:46,876 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:46,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:14:46,876 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:46,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1651988407, now seen corresponding path program 1 times [2025-03-17 19:14:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:46,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106527335] [2025-03-17 19:14:46,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:46,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:46,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-03-17 19:14:46,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-03-17 19:14:46,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:46,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:14:47,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:47,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106527335] [2025-03-17 19:14:47,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106527335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:47,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:47,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:14:47,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145523077] [2025-03-17 19:14:47,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:47,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:14:47,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:47,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:14:47,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:14:47,161 INFO L87 Difference]: Start difference. First operand 747 states and 1065 transitions. Second operand has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:47,250 INFO L93 Difference]: Finished difference Result 747 states and 1065 transitions. [2025-03-17 19:14:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:14:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 176 [2025-03-17 19:14:47,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:47,253 INFO L225 Difference]: With dead ends: 747 [2025-03-17 19:14:47,253 INFO L226 Difference]: Without dead ends: 746 [2025-03-17 19:14:47,254 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-17 19:14:47,254 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 375 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1148 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:47,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 1148 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:47,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2025-03-17 19:14:47,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 746. [2025-03-17 19:14:47,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 721 states have (on average 1.4230235783633842) internal successors, (1026), 734 states have internal predecessors, (1026), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 10 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 19:14:47,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1064 transitions. [2025-03-17 19:14:47,270 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1064 transitions. Word has length 176 [2025-03-17 19:14:47,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:47,271 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1064 transitions. [2025-03-17 19:14:47,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.0) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1064 transitions. [2025-03-17 19:14:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2025-03-17 19:14:47,272 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:47,273 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:47,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:14:47,273 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:47,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:47,273 INFO L85 PathProgramCache]: Analyzing trace with hash 327967080, now seen corresponding path program 1 times [2025-03-17 19:14:47,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:47,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398982978] [2025-03-17 19:14:47,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:47,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:47,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-03-17 19:14:47,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-03-17 19:14:47,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:47,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:47,504 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:14:47,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:47,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398982978] [2025-03-17 19:14:47,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398982978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:47,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:47,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:14:47,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620758771] [2025-03-17 19:14:47,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:47,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:14:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:47,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:14:47,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:14:47,507 INFO L87 Difference]: Start difference. First operand 746 states and 1064 transitions. Second operand has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:47,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:47,648 INFO L93 Difference]: Finished difference Result 810 states and 1148 transitions. [2025-03-17 19:14:47,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:14:47,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 177 [2025-03-17 19:14:47,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:47,653 INFO L225 Difference]: With dead ends: 810 [2025-03-17 19:14:47,653 INFO L226 Difference]: Without dead ends: 809 [2025-03-17 19:14:47,654 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-17 19:14:47,655 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 368 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:47,656 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1717 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:47,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-17 19:14:47,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 809. [2025-03-17 19:14:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 809 states, 781 states have (on average 1.412291933418694) internal successors, (1103), 794 states have internal predecessors, (1103), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:14:47,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1147 transitions. [2025-03-17 19:14:47,673 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1147 transitions. Word has length 177 [2025-03-17 19:14:47,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:47,674 INFO L471 AbstractCegarLoop]: Abstraction has 809 states and 1147 transitions. [2025-03-17 19:14:47,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:47,674 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1147 transitions. [2025-03-17 19:14:47,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-03-17 19:14:47,675 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:47,676 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:47,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 19:14:47,676 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:47,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:47,676 INFO L85 PathProgramCache]: Analyzing trace with hash -583175162, now seen corresponding path program 1 times [2025-03-17 19:14:47,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:47,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437978089] [2025-03-17 19:14:47,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:47,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:47,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-03-17 19:14:47,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-03-17 19:14:47,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:47,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:48,007 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-17 19:14:48,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:48,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437978089] [2025-03-17 19:14:48,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437978089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:48,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:48,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:14:48,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744450441] [2025-03-17 19:14:48,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:48,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:14:48,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:48,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:14:48,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:14:48,010 INFO L87 Difference]: Start difference. First operand 809 states and 1147 transitions. Second operand has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:48,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:48,118 INFO L93 Difference]: Finished difference Result 833 states and 1189 transitions. [2025-03-17 19:14:48,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:14:48,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 180 [2025-03-17 19:14:48,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:48,125 INFO L225 Difference]: With dead ends: 833 [2025-03-17 19:14:48,125 INFO L226 Difference]: Without dead ends: 831 [2025-03-17 19:14:48,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:14:48,126 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 409 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:48,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 1129 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:14:48,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2025-03-17 19:14:48,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 812. [2025-03-17 19:14:48,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 784 states have (on average 1.4107142857142858) internal successors, (1106), 797 states have internal predecessors, (1106), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:14:48,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 1150 transitions. [2025-03-17 19:14:48,152 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 1150 transitions. Word has length 180 [2025-03-17 19:14:48,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:48,152 INFO L471 AbstractCegarLoop]: Abstraction has 812 states and 1150 transitions. [2025-03-17 19:14:48,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 54.333333333333336) internal successors, (163), 4 states have internal predecessors, (163), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:48,152 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 1150 transitions. [2025-03-17 19:14:48,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-17 19:14:48,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:48,155 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:48,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 19:14:48,156 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:48,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:48,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1452873541, now seen corresponding path program 1 times [2025-03-17 19:14:48,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:48,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317735222] [2025-03-17 19:14:48,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:48,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:48,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 19:14:48,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 19:14:48,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:48,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:14:48,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:48,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317735222] [2025-03-17 19:14:48,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317735222] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:14:48,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316848764] [2025-03-17 19:14:48,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:48,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:48,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:48,853 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:48,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:14:49,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-17 19:14:49,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-17 19:14:49,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:49,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:49,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 19:14:49,324 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:49,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:14:49,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 19:14:50,112 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:14:50,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:14:50,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316848764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:50,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:14:50,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 14 [2025-03-17 19:14:50,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67917576] [2025-03-17 19:14:50,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:50,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:14:50,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:50,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:14:50,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-03-17 19:14:50,115 INFO L87 Difference]: Start difference. First operand 812 states and 1150 transitions. Second operand has 12 states, 12 states have (on average 13.75) internal successors, (165), 11 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:51,608 INFO L93 Difference]: Finished difference Result 1588 states and 2243 transitions. [2025-03-17 19:14:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 19:14:51,609 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 11 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 182 [2025-03-17 19:14:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:51,612 INFO L225 Difference]: With dead ends: 1588 [2025-03-17 19:14:51,612 INFO L226 Difference]: Without dead ends: 860 [2025-03-17 19:14:51,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-03-17 19:14:51,613 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 793 mSDsluCounter, 2721 mSDsCounter, 0 mSdLazyCounter, 1041 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 3271 SdHoareTripleChecker+Invalid, 1049 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1041 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:51,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 3271 Invalid, 1049 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1041 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 19:14:51,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2025-03-17 19:14:51,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 837. [2025-03-17 19:14:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 809 states have (on average 1.4042027194066748) internal successors, (1136), 822 states have internal predecessors, (1136), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:14:51,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1180 transitions. [2025-03-17 19:14:51,633 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1180 transitions. Word has length 182 [2025-03-17 19:14:51,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:51,633 INFO L471 AbstractCegarLoop]: Abstraction has 837 states and 1180 transitions. [2025-03-17 19:14:51,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 13.75) internal successors, (165), 11 states have internal predecessors, (165), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:51,634 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1180 transitions. [2025-03-17 19:14:51,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-17 19:14:51,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:51,635 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:51,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 19:14:51,835 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,SelfDestructingSolverStorable10 [2025-03-17 19:14:51,836 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:51,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:51,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1710326265, now seen corresponding path program 1 times [2025-03-17 19:14:51,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:51,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590011486] [2025-03-17 19:14:51,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:51,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:51,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 19:14:52,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 19:14:52,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:52,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:14:52,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590011486] [2025-03-17 19:14:52,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590011486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:14:52,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [623825226] [2025-03-17 19:14:52,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:52,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:52,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:52,485 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:52,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:14:52,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-17 19:14:53,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-17 19:14:53,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:53,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:53,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 19:14:53,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:53,058 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:14:53,059 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:14:53,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [623825226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:53,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:14:53,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-17 19:14:53,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915750318] [2025-03-17 19:14:53,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:53,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:14:53,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:53,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:14:53,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:14:53,060 INFO L87 Difference]: Start difference. First operand 837 states and 1180 transitions. Second operand has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:53,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:53,287 INFO L93 Difference]: Finished difference Result 1608 states and 2270 transitions. [2025-03-17 19:14:53,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:14:53,288 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 183 [2025-03-17 19:14:53,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:53,292 INFO L225 Difference]: With dead ends: 1608 [2025-03-17 19:14:53,292 INFO L226 Difference]: Without dead ends: 880 [2025-03-17 19:14:53,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:14:53,295 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 17 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1475 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:53,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1475 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:14:53,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 880 states. [2025-03-17 19:14:53,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 880 to 864. [2025-03-17 19:14:53,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 836 states have (on average 1.3983253588516746) internal successors, (1169), 849 states have internal predecessors, (1169), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:14:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1213 transitions. [2025-03-17 19:14:53,319 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1213 transitions. Word has length 183 [2025-03-17 19:14:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:53,319 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1213 transitions. [2025-03-17 19:14:53,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.5) internal successors, (166), 4 states have internal predecessors, (166), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1213 transitions. [2025-03-17 19:14:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-17 19:14:53,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:53,320 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:53,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 19:14:53,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:53,521 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:53,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:53,522 INFO L85 PathProgramCache]: Analyzing trace with hash -862107048, now seen corresponding path program 1 times [2025-03-17 19:14:53,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:53,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886309271] [2025-03-17 19:14:53,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:53,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:53,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-17 19:14:53,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-17 19:14:53,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:53,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:14:53,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886309271] [2025-03-17 19:14:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886309271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:53,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:53,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:14:53,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075896354] [2025-03-17 19:14:53,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:53,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:14:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:53,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:14:53,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:14:53,911 INFO L87 Difference]: Start difference. First operand 864 states and 1213 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:54,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:54,354 INFO L93 Difference]: Finished difference Result 1627 states and 2289 transitions. [2025-03-17 19:14:54,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:14:54,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 184 [2025-03-17 19:14:54,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:54,359 INFO L225 Difference]: With dead ends: 1627 [2025-03-17 19:14:54,359 INFO L226 Difference]: Without dead ends: 876 [2025-03-17 19:14:54,361 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-17 19:14:54,361 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 8 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2258 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:54,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2258 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:14:54,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-03-17 19:14:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 872. [2025-03-17 19:14:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 844 states have (on average 1.396919431279621) internal successors, (1179), 857 states have internal predecessors, (1179), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:14:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1223 transitions. [2025-03-17 19:14:54,385 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1223 transitions. Word has length 184 [2025-03-17 19:14:54,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:54,385 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1223 transitions. [2025-03-17 19:14:54,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:54,386 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1223 transitions. [2025-03-17 19:14:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 19:14:54,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:54,388 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:54,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:14:54,389 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:54,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:54,390 INFO L85 PathProgramCache]: Analyzing trace with hash -746587421, now seen corresponding path program 1 times [2025-03-17 19:14:54,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:54,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736726643] [2025-03-17 19:14:54,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:54,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:54,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:14:54,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:14:54,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:54,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:14:54,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:54,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736726643] [2025-03-17 19:14:54,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736726643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:14:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405820430] [2025-03-17 19:14:54,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:54,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:14:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:54,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:14:54,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:14:54,741 INFO L87 Difference]: Start difference. First operand 872 states and 1223 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:55,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:55,256 INFO L93 Difference]: Finished difference Result 1642 states and 2309 transitions. [2025-03-17 19:14:55,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:14:55,256 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-17 19:14:55,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:55,260 INFO L225 Difference]: With dead ends: 1642 [2025-03-17 19:14:55,260 INFO L226 Difference]: Without dead ends: 894 [2025-03-17 19:14:55,261 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-17 19:14:55,261 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 12 mSDsluCounter, 2143 mSDsCounter, 0 mSdLazyCounter, 917 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2681 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:55,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2681 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 917 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 19:14:55,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-03-17 19:14:55,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 888. [2025-03-17 19:14:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 860 states have (on average 1.3965116279069767) internal successors, (1201), 873 states have internal predecessors, (1201), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:14:55,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1245 transitions. [2025-03-17 19:14:55,280 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1245 transitions. Word has length 185 [2025-03-17 19:14:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:55,280 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1245 transitions. [2025-03-17 19:14:55,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1245 transitions. [2025-03-17 19:14:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-17 19:14:55,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:55,281 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:55,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 19:14:55,282 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:55,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:55,282 INFO L85 PathProgramCache]: Analyzing trace with hash 870146700, now seen corresponding path program 1 times [2025-03-17 19:14:55,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:55,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299246185] [2025-03-17 19:14:55,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:55,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:55,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:14:55,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:14:55,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:55,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:55,688 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:14:55,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299246185] [2025-03-17 19:14:55,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299246185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:14:55,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132754380] [2025-03-17 19:14:55,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:55,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:55,691 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:55,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:14:56,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-17 19:14:56,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-17 19:14:56,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:56,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:56,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 1037 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 19:14:56,249 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:56,427 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:14:56,427 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:14:56,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132754380] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:56,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:14:56,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 19:14:56,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163089927] [2025-03-17 19:14:56,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:56,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:14:56,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:56,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:14:56,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:14:56,430 INFO L87 Difference]: Start difference. First operand 888 states and 1245 transitions. Second operand has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:56,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:56,962 INFO L93 Difference]: Finished difference Result 1658 states and 2330 transitions. [2025-03-17 19:14:56,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:14:56,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 185 [2025-03-17 19:14:56,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:56,966 INFO L225 Difference]: With dead ends: 1658 [2025-03-17 19:14:56,966 INFO L226 Difference]: Without dead ends: 902 [2025-03-17 19:14:56,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:14:56,968 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 12 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:56,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 2687 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 19:14:56,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2025-03-17 19:14:56,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 888. [2025-03-17 19:14:56,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 888 states, 860 states have (on average 1.3965116279069767) internal successors, (1201), 873 states have internal predecessors, (1201), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:14:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 1245 transitions. [2025-03-17 19:14:56,986 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 1245 transitions. Word has length 185 [2025-03-17 19:14:56,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:56,987 INFO L471 AbstractCegarLoop]: Abstraction has 888 states and 1245 transitions. [2025-03-17 19:14:56,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.0) internal successors, (168), 7 states have internal predecessors, (168), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:56,987 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 1245 transitions. [2025-03-17 19:14:56,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 19:14:56,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:56,988 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:56,999 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-17 19:14:57,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 19:14:57,189 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:57,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:57,190 INFO L85 PathProgramCache]: Analyzing trace with hash 121497809, now seen corresponding path program 1 times [2025-03-17 19:14:57,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:57,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864607636] [2025-03-17 19:14:57,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:57,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:57,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 19:14:57,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 19:14:57,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:57,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:57,621 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:14:57,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:57,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864607636] [2025-03-17 19:14:57,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864607636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:57,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:14:57,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 19:14:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126163769] [2025-03-17 19:14:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:57,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 19:14:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:57,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 19:14:57,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:14:57,622 INFO L87 Difference]: Start difference. First operand 888 states and 1245 transitions. Second operand has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:14:58,185 INFO L93 Difference]: Finished difference Result 1665 states and 2336 transitions. [2025-03-17 19:14:58,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 19:14:58,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-17 19:14:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:14:58,188 INFO L225 Difference]: With dead ends: 1665 [2025-03-17 19:14:58,188 INFO L226 Difference]: Without dead ends: 914 [2025-03-17 19:14:58,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:14:58,190 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 20 mSDsluCounter, 3110 mSDsCounter, 0 mSdLazyCounter, 1150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 3648 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 19:14:58,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 3648 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1150 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 19:14:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-03-17 19:14:58,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 902. [2025-03-17 19:14:58,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 874 states have (on average 1.394736842105263) internal successors, (1219), 887 states have internal predecessors, (1219), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:14:58,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1263 transitions. [2025-03-17 19:14:58,209 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1263 transitions. Word has length 186 [2025-03-17 19:14:58,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:14:58,209 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1263 transitions. [2025-03-17 19:14:58,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.77777777777778) internal successors, (169), 9 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:14:58,209 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1263 transitions. [2025-03-17 19:14:58,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2025-03-17 19:14:58,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:14:58,211 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:14:58,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 19:14:58,211 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:14:58,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:14:58,211 INFO L85 PathProgramCache]: Analyzing trace with hash -1299351992, now seen corresponding path program 1 times [2025-03-17 19:14:58,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:14:58,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241060958] [2025-03-17 19:14:58,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:58,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:14:58,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 19:14:58,434 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 19:14:58,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:58,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:58,596 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:14:58,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:14:58,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241060958] [2025-03-17 19:14:58,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241060958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:14:58,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2145394995] [2025-03-17 19:14:58,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:14:58,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:14:58,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:14:58,598 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:14:58,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:14:58,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-17 19:14:59,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-17 19:14:59,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:14:59,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:14:59,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 1038 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 19:14:59,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:14:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:14:59,204 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:14:59,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2145394995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:14:59,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:14:59,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-17 19:14:59,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525389380] [2025-03-17 19:14:59,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:14:59,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:14:59,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:14:59,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:14:59,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:14:59,206 INFO L87 Difference]: Start difference. First operand 902 states and 1263 transitions. Second operand has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:00,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:00,098 INFO L93 Difference]: Finished difference Result 1686 states and 2363 transitions. [2025-03-17 19:15:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:15:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 186 [2025-03-17 19:15:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:00,102 INFO L225 Difference]: With dead ends: 1686 [2025-03-17 19:15:00,102 INFO L226 Difference]: Without dead ends: 928 [2025-03-17 19:15:00,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:15:00,104 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 17 mSDsluCounter, 2204 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2750 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:00,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2750 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 19:15:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2025-03-17 19:15:00,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 912. [2025-03-17 19:15:00,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 912 states, 884 states have (on average 1.3925339366515836) internal successors, (1231), 897 states have internal predecessors, (1231), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:15:00,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 912 states to 912 states and 1275 transitions. [2025-03-17 19:15:00,159 INFO L78 Accepts]: Start accepts. Automaton has 912 states and 1275 transitions. Word has length 186 [2025-03-17 19:15:00,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:00,160 INFO L471 AbstractCegarLoop]: Abstraction has 912 states and 1275 transitions. [2025-03-17 19:15:00,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.125) internal successors, (169), 8 states have internal predecessors, (169), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:00,160 INFO L276 IsEmpty]: Start isEmpty. Operand 912 states and 1275 transitions. [2025-03-17 19:15:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 19:15:00,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:00,162 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:15:00,177 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-17 19:15:00,366 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,SelfDestructingSolverStorable16 [2025-03-17 19:15:00,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:15:00,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:00,367 INFO L85 PathProgramCache]: Analyzing trace with hash -657803268, now seen corresponding path program 1 times [2025-03-17 19:15:00,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:00,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715514598] [2025-03-17 19:15:00,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:00,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:00,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:15:00,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:15:00,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:00,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:00,860 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:15:00,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:00,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715514598] [2025-03-17 19:15:00,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715514598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:00,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:15:00,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 19:15:00,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168063021] [2025-03-17 19:15:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:00,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:15:00,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:00,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:15:00,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:15:00,863 INFO L87 Difference]: Start difference. First operand 912 states and 1275 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:01,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:01,578 INFO L93 Difference]: Finished difference Result 1698 states and 2379 transitions. [2025-03-17 19:15:01,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:15:01,578 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-17 19:15:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:01,581 INFO L225 Difference]: With dead ends: 1698 [2025-03-17 19:15:01,581 INFO L226 Difference]: Without dead ends: 930 [2025-03-17 19:15:01,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:15:01,583 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 23 mSDsluCounter, 3086 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3630 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:01,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3630 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 19:15:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2025-03-17 19:15:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 918. [2025-03-17 19:15:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 918 states, 890 states have (on average 1.3898876404494382) internal successors, (1237), 903 states have internal predecessors, (1237), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:15:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 1281 transitions. [2025-03-17 19:15:01,617 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 1281 transitions. Word has length 187 [2025-03-17 19:15:01,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:01,618 INFO L471 AbstractCegarLoop]: Abstraction has 918 states and 1281 transitions. [2025-03-17 19:15:01,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 1281 transitions. [2025-03-17 19:15:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 19:15:01,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:01,619 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:15:01,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 19:15:01,620 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:15:01,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:01,620 INFO L85 PathProgramCache]: Analyzing trace with hash 564875849, now seen corresponding path program 1 times [2025-03-17 19:15:01,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:01,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925163477] [2025-03-17 19:15:01,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:01,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:01,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:15:02,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:15:02,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:02,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:15:02,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925163477] [2025-03-17 19:15:02,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925163477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:02,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1147330255] [2025-03-17 19:15:02,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:02,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:02,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:02,165 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:15:02,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:15:02,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:15:02,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:15:02,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:02,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:02,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 19:15:02,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:02,970 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:15:02,970 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:15:02,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1147330255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:02,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:15:02,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-17 19:15:02,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086744748] [2025-03-17 19:15:02,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:02,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:15:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:02,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:15:02,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:15:02,973 INFO L87 Difference]: Start difference. First operand 918 states and 1281 transitions. Second operand has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:03,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:03,661 INFO L93 Difference]: Finished difference Result 1703 states and 2384 transitions. [2025-03-17 19:15:03,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:15:03,661 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-17 19:15:03,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:03,664 INFO L225 Difference]: With dead ends: 1703 [2025-03-17 19:15:03,664 INFO L226 Difference]: Without dead ends: 932 [2025-03-17 19:15:03,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 19:15:03,665 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 10 mSDsluCounter, 2144 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2687 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:03,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2687 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 19:15:03,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2025-03-17 19:15:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 920. [2025-03-17 19:15:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 920 states, 892 states have (on average 1.391255605381166) internal successors, (1241), 905 states have internal predecessors, (1241), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:15:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1285 transitions. [2025-03-17 19:15:03,680 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1285 transitions. Word has length 187 [2025-03-17 19:15:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 920 states and 1285 transitions. [2025-03-17 19:15:03,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.285714285714285) internal successors, (170), 7 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1285 transitions. [2025-03-17 19:15:03,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 19:15:03,682 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:03,682 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:15:03,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-17 19:15:03,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:03,882 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:15:03,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash -1629961211, now seen corresponding path program 1 times [2025-03-17 19:15:03,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:03,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732885374] [2025-03-17 19:15:03,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:03,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:03,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:15:04,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:15:04,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:04,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:04,538 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:15:04,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:04,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732885374] [2025-03-17 19:15:04,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732885374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846496721] [2025-03-17 19:15:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:04,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:04,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:04,541 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:15:04,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:15:04,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:15:05,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:15:05,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:05,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:05,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 19:15:05,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:05,220 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:15:05,220 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:15:05,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1846496721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:05,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:15:05,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-17 19:15:05,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071558143] [2025-03-17 19:15:05,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:05,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 19:15:05,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:05,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 19:15:05,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:15:05,223 INFO L87 Difference]: Start difference. First operand 920 states and 1285 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:05,799 INFO L93 Difference]: Finished difference Result 1711 states and 2392 transitions. [2025-03-17 19:15:05,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:15:05,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-17 19:15:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:05,802 INFO L225 Difference]: With dead ends: 1711 [2025-03-17 19:15:05,802 INFO L226 Difference]: Without dead ends: 944 [2025-03-17 19:15:05,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:15:05,804 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 16 mSDsluCounter, 2654 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3199 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:05,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3199 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 19:15:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-17 19:15:05,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 934. [2025-03-17 19:15:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 934 states, 906 states have (on average 1.3896247240618103) internal successors, (1259), 919 states have internal predecessors, (1259), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:15:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 934 states to 934 states and 1303 transitions. [2025-03-17 19:15:05,818 INFO L78 Accepts]: Start accepts. Automaton has 934 states and 1303 transitions. Word has length 187 [2025-03-17 19:15:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:05,818 INFO L471 AbstractCegarLoop]: Abstraction has 934 states and 1303 transitions. [2025-03-17 19:15:05,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 8 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 934 states and 1303 transitions. [2025-03-17 19:15:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-03-17 19:15:05,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:05,820 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:15:05,831 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-17 19:15:06,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:06,021 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:15:06,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:06,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1754474139, now seen corresponding path program 1 times [2025-03-17 19:15:06,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:06,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410780719] [2025-03-17 19:15:06,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:06,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:06,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:15:06,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:15:06,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:06,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:06,654 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:15:06,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:06,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410780719] [2025-03-17 19:15:06,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410780719] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:06,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627832020] [2025-03-17 19:15:06,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:06,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:06,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:06,656 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:15:06,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 19:15:07,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-17 19:15:07,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-17 19:15:07,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:07,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:07,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 19:15:07,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:07,714 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 19:15:07,714 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:15:07,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627832020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:07,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:15:07,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [4] total 12 [2025-03-17 19:15:07,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677318146] [2025-03-17 19:15:07,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:07,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 19:15:07,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:07,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 19:15:07,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:15:07,716 INFO L87 Difference]: Start difference. First operand 934 states and 1303 transitions. Second operand has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:08,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:08,993 INFO L93 Difference]: Finished difference Result 1735 states and 2428 transitions. [2025-03-17 19:15:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 19:15:08,993 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 187 [2025-03-17 19:15:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:08,996 INFO L225 Difference]: With dead ends: 1735 [2025-03-17 19:15:08,996 INFO L226 Difference]: Without dead ends: 956 [2025-03-17 19:15:08,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:15:08,998 INFO L435 NwaCegarLoop]: 544 mSDtfsCounter, 17 mSDsluCounter, 3425 mSDsCounter, 0 mSdLazyCounter, 1586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 3969 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:08,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 3969 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1586 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-17 19:15:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2025-03-17 19:15:09,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 948. [2025-03-17 19:15:09,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 920 states have (on average 1.3880434782608695) internal successors, (1277), 933 states have internal predecessors, (1277), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 13 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-17 19:15:09,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1321 transitions. [2025-03-17 19:15:09,015 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1321 transitions. Word has length 187 [2025-03-17 19:15:09,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:09,015 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1321 transitions. [2025-03-17 19:15:09,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 17.0) internal successors, (170), 10 states have internal predecessors, (170), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2025-03-17 19:15:09,016 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1321 transitions. [2025-03-17 19:15:09,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2025-03-17 19:15:09,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:09,017 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:15:09,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 19:15:09,217 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,SelfDestructingSolverStorable20 [2025-03-17 19:15:09,218 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:15:09,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:09,218 INFO L85 PathProgramCache]: Analyzing trace with hash 94292698, now seen corresponding path program 1 times [2025-03-17 19:15:09,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:09,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375715031] [2025-03-17 19:15:09,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:09,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:09,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 19:15:09,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 19:15:09,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:09,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 19:15:09,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:09,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375715031] [2025-03-17 19:15:09,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375715031] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:09,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1105922662] [2025-03-17 19:15:09,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:09,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:09,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:09,701 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:15:09,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 19:15:10,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-17 19:15:10,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-17 19:15:10,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:10,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:10,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:15:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:10,538 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 19:15:10,538 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:15:10,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1105922662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:15:10,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:15:10,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-17 19:15:10,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367568642] [2025-03-17 19:15:10,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:15:10,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:15:10,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:15:10,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:15:10,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:15:10,540 INFO L87 Difference]: Start difference. First operand 948 states and 1321 transitions. Second operand has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:15:10,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:15:10,618 INFO L93 Difference]: Finished difference Result 1697 states and 2378 transitions. [2025-03-17 19:15:10,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:15:10,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 188 [2025-03-17 19:15:10,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:15:10,623 INFO L225 Difference]: With dead ends: 1697 [2025-03-17 19:15:10,623 INFO L226 Difference]: Without dead ends: 951 [2025-03-17 19:15:10,624 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:15:10,625 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 0 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:15:10,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1646 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:15:10,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-17 19:15:10,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2025-03-17 19:15:10,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 922 states have (on average 1.3882863340563991) internal successors, (1280), 936 states have internal predecessors, (1280), 22 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (26), 13 states have call predecessors, (26), 22 states have call successors, (26) [2025-03-17 19:15:10,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1328 transitions. [2025-03-17 19:15:10,640 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1328 transitions. Word has length 188 [2025-03-17 19:15:10,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:15:10,641 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1328 transitions. [2025-03-17 19:15:10,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.25) internal successors, (177), 4 states have internal predecessors, (177), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-17 19:15:10,641 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1328 transitions. [2025-03-17 19:15:10,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-03-17 19:15:10,642 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:15:10,642 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:15:10,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-17 19:15:10,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:10,843 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:15:10,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:15:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash 307425250, now seen corresponding path program 1 times [2025-03-17 19:15:10,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:15:10,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142721695] [2025-03-17 19:15:10,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:10,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:15:10,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:15:11,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:15:11,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:11,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:11,485 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 5 proven. 19 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-17 19:15:11,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:15:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142721695] [2025-03-17 19:15:11,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142721695] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:15:11,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854503115] [2025-03-17 19:15:11,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:15:11,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:15:11,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:15:11,488 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:15:11,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-17 19:15:11,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-17 19:15:12,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-17 19:15:12,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:15:12,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:15:12,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 185 conjuncts are in the unsatisfiable core [2025-03-17 19:15:12,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:15:12,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:15:12,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 19:15:12,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:15:12,602 INFO L349 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2025-03-17 19:15:12,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2025-03-17 19:15:12,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 19:15:12,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-03-17 19:15:12,756 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 19:15:12,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 19:15:12,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 19:15:16,037 INFO L224 Elim1Store]: Index analysis took 129 ms