./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/list-simple/sll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_append_unequal.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 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:43:08,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:43:08,571 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:43:08,575 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:43:08,575 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:43:08,592 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:43:08,593 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:43:08,593 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:43:08,593 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:43:08,593 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:43:08,593 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:43:08,593 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:43:08,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:43:08,594 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:43:08,594 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:43:08,594 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:43:08,595 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:43:08,595 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:43:08,595 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:43:08,595 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:43:08,595 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:43:08,595 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:43:08,595 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:43:08,595 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:43:08,595 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:43:08,596 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:43:08,596 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:43:08,596 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:43:08,596 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:43:08,596 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:43:08,596 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:43:08,596 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:43:08,596 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:43:08,596 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:43:08,596 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:43:08,596 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:43:08,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:43:08,597 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:43:08,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:43:08,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:43:08,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:43:08,597 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:43:08,597 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:43:08,597 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:43:08,597 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:43:08,597 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 -> 742ffe63db70127807dbc7584eb0c51633a9ed1be5f19fa1a247e43392d52dab [2025-03-04 10:43:08,840 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:43:08,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:43:08,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:43:08,852 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:43:08,852 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:43:08,853 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2025-03-04 10:43:10,034 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df59a2196/0b92ba5ad7b1451e942fcbf7fd6f016b/FLAGb17aa18ec [2025-03-04 10:43:10,328 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:43:10,329 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2025-03-04 10:43:10,344 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df59a2196/0b92ba5ad7b1451e942fcbf7fd6f016b/FLAGb17aa18ec [2025-03-04 10:43:10,601 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df59a2196/0b92ba5ad7b1451e942fcbf7fd6f016b [2025-03-04 10:43:10,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:43:10,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:43:10,605 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:43:10,605 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:43:10,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:43:10,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:10,609 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8fa3d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10, skipping insertion in model container [2025-03-04 10:43:10,609 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:10,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:43:10,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:43:10,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:43:10,904 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:43:10,926 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:43:10,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10 WrapperNode [2025-03-04 10:43:10,927 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:43:10,928 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:43:10,928 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:43:10,928 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:43:10,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:10,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:10,962 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2025-03-04 10:43:10,964 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:43:10,965 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:43:10,965 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:43:10,965 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:43:10,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:10,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:10,974 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:10,996 INFO L175 MemorySlicer]: Split 20 memory accesses to 3 slices as follows [2, 12, 6]. 60 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 5 writes are split as follows [0, 4, 1]. [2025-03-04 10:43:10,999 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:10,999 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:11,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:11,008 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:11,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:11,012 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:11,013 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:43:11,014 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:43:11,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:43:11,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:43:11,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (1/1) ... [2025-03-04 10:43:11,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:43:11,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:11,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:43:11,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:43:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 10:43:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 10:43:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 10:43:11,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 10:43:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 10:43:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 10:43:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-04 10:43:11,070 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-04 10:43:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:43:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:43:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 10:43:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:43:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:43:11,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 10:43:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:43:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:43:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 10:43:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:43:11,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:43:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:43:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 10:43:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:43:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:43:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 10:43:11,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:43:11,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:43:11,171 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:43:11,173 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:43:11,336 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L614: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-04 10:43:11,353 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-04 10:43:11,363 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-03-04 10:43:11,363 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:43:11,371 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:43:11,371 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:43:11,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:11 BoogieIcfgContainer [2025-03-04 10:43:11,372 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:43:11,374 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:43:11,374 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:43:11,378 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:43:11,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:43:10" (1/3) ... [2025-03-04 10:43:11,379 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e123b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:43:11, skipping insertion in model container [2025-03-04 10:43:11,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:43:10" (2/3) ... [2025-03-04 10:43:11,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e123b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:43:11, skipping insertion in model container [2025-03-04 10:43:11,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:43:11" (3/3) ... [2025-03-04 10:43:11,381 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2025-03-04 10:43:11,393 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:43:11,395 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2n_append_unequal.i that has 2 procedures, 50 locations, 1 initial locations, 4 loop locations, and 8 error locations. [2025-03-04 10:43:11,437 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:43:11,447 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;@abdac65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:43:11,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 10:43:11,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 46 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 10:43:11,456 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:11,456 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:11,457 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:11,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:11,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1386262017, now seen corresponding path program 1 times [2025-03-04 10:43:11,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:11,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981001628] [2025-03-04 10:43:11,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:11,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:11,552 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 10:43:11,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 10:43:11,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:11,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:11,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:11,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981001628] [2025-03-04 10:43:11,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981001628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:11,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:11,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:11,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920975049] [2025-03-04 10:43:11,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:11,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:11,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:11,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:11,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:11,793 INFO L87 Difference]: Start difference. First operand has 50 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 46 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:11,842 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2025-03-04 10:43:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:11,844 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2025-03-04 10:43:11,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:11,850 INFO L225 Difference]: With dead ends: 97 [2025-03-04 10:43:11,850 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 10:43:11,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:11,855 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:11,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 155 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:11,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 10:43:11,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 10:43:11,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 40 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-03-04 10:43:11,900 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 11 [2025-03-04 10:43:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:11,901 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-04 10:43:11,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 10:43:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-03-04 10:43:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 10:43:11,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:11,902 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:43:11,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:43:11,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:11,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:11,903 INFO L85 PathProgramCache]: Analyzing trace with hash 456794239, now seen corresponding path program 1 times [2025-03-04 10:43:11,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:11,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215612064] [2025-03-04 10:43:11,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:11,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:11,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 10:43:11,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 10:43:11,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:11,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:12,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:43:12,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:12,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215612064] [2025-03-04 10:43:12,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215612064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:12,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:12,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:12,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369830163] [2025-03-04 10:43:12,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:12,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:12,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:12,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:12,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:12,034 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:12,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:12,059 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-04 10:43:12,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:12,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2025-03-04 10:43:12,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:12,060 INFO L225 Difference]: With dead ends: 45 [2025-03-04 10:43:12,060 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 10:43:12,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:12,061 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:12,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 111 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 10:43:12,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 10:43:12,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 39 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:12,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-03-04 10:43:12,070 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2025-03-04 10:43:12,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:12,070 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-03-04 10:43:12,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-03-04 10:43:12,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:43:12,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:12,071 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 10:43:12,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:43:12,072 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:12,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1275719553, now seen corresponding path program 1 times [2025-03-04 10:43:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:12,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591970950] [2025-03-04 10:43:12,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:12,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:12,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:43:12,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:43:12,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:12,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:12,211 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:43:12,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591970950] [2025-03-04 10:43:12,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591970950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:12,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503316486] [2025-03-04 10:43:12,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:12,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:12,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:12,216 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:12,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:43:12,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:43:12,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:43:12,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:12,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:12,314 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 10:43:12,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:12,372 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:43:12,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:43:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503316486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:43:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:43:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707817804] [2025-03-04 10:43:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:12,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:43:12,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:12,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:43:12,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:43:12,374 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:12,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:12,402 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-03-04 10:43:12,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:43:12,405 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2025-03-04 10:43:12,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:12,405 INFO L225 Difference]: With dead ends: 44 [2025-03-04 10:43:12,405 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 10:43:12,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:43:12,406 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:12,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 10:43:12,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2025-03-04 10:43:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 35 states have internal predecessors, (40), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:12,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-04 10:43:12,413 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 22 [2025-03-04 10:43:12,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:12,413 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-04 10:43:12,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:12,414 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-04 10:43:12,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 10:43:12,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:12,415 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:12,422 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:12,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:12,619 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:12,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:12,620 INFO L85 PathProgramCache]: Analyzing trace with hash 656297219, now seen corresponding path program 1 times [2025-03-04 10:43:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:12,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308489575] [2025-03-04 10:43:12,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:12,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:43:12,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:43:12,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:12,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:12,758 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:43:12,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:12,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308489575] [2025-03-04 10:43:12,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308489575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:12,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627891787] [2025-03-04 10:43:12,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:12,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:12,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:12,762 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:12,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:43:12,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 10:43:12,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 10:43:12,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:12,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:12,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:43:12,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:43:12,892 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:43:12,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627891787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:12,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:43:12,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:43:12,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931530857] [2025-03-04 10:43:12,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:12,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:12,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:12,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:12,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:43:12,894 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:12,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:12,900 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-04 10:43:12,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:12,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 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 25 [2025-03-04 10:43:12,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:12,903 INFO L225 Difference]: With dead ends: 39 [2025-03-04 10:43:12,903 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 10:43:12,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:43:12,904 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:12,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 47 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:12,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 10:43:12,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 10:43:12,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.3) internal successors, (39), 34 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:12,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-04 10:43:12,911 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2025-03-04 10:43:12,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:12,911 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-04 10:43:12,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:12,912 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-04 10:43:12,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 10:43:12,912 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:12,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:12,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 10:43:13,113 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,SelfDestructingSolverStorable3 [2025-03-04 10:43:13,113 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:13,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1129622705, now seen corresponding path program 1 times [2025-03-04 10:43:13,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:13,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980834733] [2025-03-04 10:43:13,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:13,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:13,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:43:13,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:43:13,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:13,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:13,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:43:13,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980834733] [2025-03-04 10:43:13,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980834733] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:13,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113205323] [2025-03-04 10:43:13,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:13,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:13,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:13,233 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:13,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:43:13,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 10:43:13,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 10:43:13,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:13,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:13,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 10:43:13,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-04 10:43:13,362 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:43:13,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113205323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:13,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:43:13,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-04 10:43:13,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890683702] [2025-03-04 10:43:13,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:13,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:43:13,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:13,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:43:13,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:43:13,363 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:13,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:13,367 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-04 10:43:13,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:43:13,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 26 [2025-03-04 10:43:13,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:13,368 INFO L225 Difference]: With dead ends: 38 [2025-03-04 10:43:13,368 INFO L226 Difference]: Without dead ends: 35 [2025-03-04 10:43:13,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 10:43:13,369 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 20 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:13,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-04 10:43:13,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-04 10:43:13,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:13,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-04 10:43:13,372 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2025-03-04 10:43:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:13,372 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-04 10:43:13,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-04 10:43:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-04 10:43:13,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:13,373 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:13,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:13,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:13,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:13,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:13,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1059152873, now seen corresponding path program 1 times [2025-03-04 10:43:13,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:13,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430484366] [2025-03-04 10:43:13,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:13,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:13,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:43:13,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:43:13,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:13,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:13,662 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:43:13,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:13,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430484366] [2025-03-04 10:43:13,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430484366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:13,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349744598] [2025-03-04 10:43:13,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:13,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:13,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:13,665 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:13,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 10:43:13,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 10:43:13,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 10:43:13,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:13,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:13,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 10:43:13,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:13,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:43:13,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 10:43:13,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349744598] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:13,826 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:13,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 10:43:13,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633243406] [2025-03-04 10:43:13,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:13,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 10:43:13,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:13,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 10:43:13,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:43:13,827 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:43:13,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:13,851 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-03-04 10:43:13,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:43:13,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-03-04 10:43:13,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:13,851 INFO L225 Difference]: With dead ends: 67 [2025-03-04 10:43:13,852 INFO L226 Difference]: Without dead ends: 40 [2025-03-04 10:43:13,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:43:13,853 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:13,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 158 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-04 10:43:13,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-04 10:43:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.21875) internal successors, (39), 35 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:13,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-03-04 10:43:13,859 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 28 [2025-03-04 10:43:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:13,860 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-03-04 10:43:13,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 10:43:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-03-04 10:43:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 10:43:13,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:13,860 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:13,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 10:43:14,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:14,061 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:14,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:14,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1385339543, now seen corresponding path program 2 times [2025-03-04 10:43:14,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:14,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166094883] [2025-03-04 10:43:14,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:14,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:14,082 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-04 10:43:14,086 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 38 statements. [2025-03-04 10:43:14,086 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:43:14,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:14,132 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:14,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:14,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166094883] [2025-03-04 10:43:14,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166094883] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:14,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:14,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:14,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572901462] [2025-03-04 10:43:14,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:14,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:14,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:14,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:14,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:14,136 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:14,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:14,155 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-03-04 10:43:14,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:14,155 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 38 [2025-03-04 10:43:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:14,156 INFO L225 Difference]: With dead ends: 49 [2025-03-04 10:43:14,156 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 10:43:14,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:14,157 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:14,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 96 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:14,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 10:43:14,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-04 10:43:14,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 40 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-03-04 10:43:14,163 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 38 [2025-03-04 10:43:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:14,165 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-04 10:43:14,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-03-04 10:43:14,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-04 10:43:14,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:14,166 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:14,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:43:14,166 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:14,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:14,167 INFO L85 PathProgramCache]: Analyzing trace with hash 4108555, now seen corresponding path program 1 times [2025-03-04 10:43:14,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:14,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862931171] [2025-03-04 10:43:14,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:14,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:14,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-04 10:43:14,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-04 10:43:14,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:14,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:14,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862931171] [2025-03-04 10:43:14,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862931171] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:14,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:14,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:43:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678498177] [2025-03-04 10:43:14,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:14,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:43:14,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:14,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:43:14,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:14,252 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:14,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:14,270 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-04 10:43:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:14,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 39 [2025-03-04 10:43:14,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:14,271 INFO L225 Difference]: With dead ends: 51 [2025-03-04 10:43:14,271 INFO L226 Difference]: Without dead ends: 45 [2025-03-04 10:43:14,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:43:14,272 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:14,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 98 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:14,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-04 10:43:14,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-04 10:43:14,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 40 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:14,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-04 10:43:14,279 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 39 [2025-03-04 10:43:14,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:14,280 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-04 10:43:14,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:14,280 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-04 10:43:14,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:43:14,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:14,282 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:14,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 10:43:14,282 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:14,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:14,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1151554800, now seen corresponding path program 1 times [2025-03-04 10:43:14,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:14,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465304814] [2025-03-04 10:43:14,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:14,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:14,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:43:14,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:43:14,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:14,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:14,401 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:14,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465304814] [2025-03-04 10:43:14,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465304814] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:14,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614125207] [2025-03-04 10:43:14,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:14,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:14,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:14,405 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:14,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 10:43:14,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:43:14,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:43:14,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:14,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:14,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:43:14,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:14,560 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:14,560 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:43:14,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614125207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:14,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:43:14,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 10:43:14,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143054612] [2025-03-04 10:43:14,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:14,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:43:14,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:14,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:43:14,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:43:14,562 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:14,574 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-03-04 10:43:14,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:43:14,574 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 43 [2025-03-04 10:43:14,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:14,575 INFO L225 Difference]: With dead ends: 45 [2025-03-04 10:43:14,575 INFO L226 Difference]: Without dead ends: 44 [2025-03-04 10:43:14,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:43:14,576 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:14,576 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 88 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-04 10:43:14,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-04 10:43:14,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.162162162162162) internal successors, (43), 39 states have internal predecessors, (43), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:14,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-04 10:43:14,579 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 43 [2025-03-04 10:43:14,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:14,580 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-04 10:43:14,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-04 10:43:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:43:14,580 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:14,580 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:14,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:14,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:14,781 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:14,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:14,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1338499004, now seen corresponding path program 1 times [2025-03-04 10:43:14,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:14,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33175863] [2025-03-04 10:43:14,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:14,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:14,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:43:14,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:43:14,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:14,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:14,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:14,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33175863] [2025-03-04 10:43:14,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33175863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:14,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [118369410] [2025-03-04 10:43:14,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:14,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:14,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:14,893 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:14,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 10:43:14,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:43:15,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:43:15,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:15,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:15,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:43:15,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:15,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:43:15,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [118369410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:15,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:43:15,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 10:43:15,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801695434] [2025-03-04 10:43:15,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:15,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:43:15,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:15,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:43:15,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:43:15,040 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:15,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:15,058 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-03-04 10:43:15,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:43:15,059 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 44 [2025-03-04 10:43:15,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:15,059 INFO L225 Difference]: With dead ends: 44 [2025-03-04 10:43:15,059 INFO L226 Difference]: Without dead ends: 43 [2025-03-04 10:43:15,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:43:15,060 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 3 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:15,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 107 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-04 10:43:15,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-04 10:43:15,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:15,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-04 10:43:15,064 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 44 [2025-03-04 10:43:15,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:15,064 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-04 10:43:15,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:15,064 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-04 10:43:15,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-04 10:43:15,065 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:15,065 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:15,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:15,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:15,266 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:15,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:15,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1338460432, now seen corresponding path program 1 times [2025-03-04 10:43:15,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:15,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476109216] [2025-03-04 10:43:15,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:15,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:15,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:43:15,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:43:15,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:15,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:15,348 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:15,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:15,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476109216] [2025-03-04 10:43:15,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476109216] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:15,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264239954] [2025-03-04 10:43:15,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:15,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:15,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:15,351 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:15,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 10:43:15,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 10:43:15,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 10:43:15,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:15,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:15,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:43:15,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:15,519 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:15,519 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:15,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264239954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:15,569 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:15,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:43:15,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8638867] [2025-03-04 10:43:15,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:15,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:43:15,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:15,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:43:15,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:43:15,571 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:15,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:15,604 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2025-03-04 10:43:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:43:15,604 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 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 44 [2025-03-04 10:43:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:15,608 INFO L225 Difference]: With dead ends: 65 [2025-03-04 10:43:15,609 INFO L226 Difference]: Without dead ends: 64 [2025-03-04 10:43:15,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:43:15,610 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:15,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 208 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-04 10:43:15,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2025-03-04 10:43:15,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.1538461538461537) internal successors, (60), 53 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:15,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-03-04 10:43:15,616 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 44 [2025-03-04 10:43:15,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:15,616 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-04 10:43:15,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.090909090909091) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:15,618 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2025-03-04 10:43:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 10:43:15,619 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:15,619 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:15,626 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 10:43:15,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:15,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:15,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:15,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1456203826, now seen corresponding path program 1 times [2025-03-04 10:43:15,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:15,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828716924] [2025-03-04 10:43:15,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:15,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:15,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:43:15,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:43:15,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:15,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:15,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:15,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828716924] [2025-03-04 10:43:15,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828716924] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:15,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131390127] [2025-03-04 10:43:15,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:15,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:15,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:15,927 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:15,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 10:43:16,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 10:43:16,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 10:43:16,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:16,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:16,068 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:43:16,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:16,104 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:16,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:16,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131390127] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:16,164 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:16,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:43:16,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097714893] [2025-03-04 10:43:16,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:16,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:43:16,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:16,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:43:16,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:43:16,165 INFO L87 Difference]: Start difference. First operand 58 states and 66 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:16,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:16,210 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-03-04 10:43:16,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:43:16,210 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 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 45 [2025-03-04 10:43:16,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:16,211 INFO L225 Difference]: With dead ends: 67 [2025-03-04 10:43:16,211 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 10:43:16,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:43:16,212 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 2 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:16,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 288 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:16,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 10:43:16,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 10:43:16,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 53 states have internal predecessors, (58), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:16,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-03-04 10:43:16,223 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 45 [2025-03-04 10:43:16,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:16,223 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-03-04 10:43:16,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:16,223 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-03-04 10:43:16,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-04 10:43:16,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:16,224 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:16,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:16,424 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,SelfDestructingSolverStorable11 [2025-03-04 10:43:16,424 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:16,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:16,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1969075246, now seen corresponding path program 2 times [2025-03-04 10:43:16,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:16,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139146689] [2025-03-04 10:43:16,425 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:16,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:16,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-04 10:43:16,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 55 statements. [2025-03-04 10:43:16,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:43:16,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:16,824 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 10:43:16,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:16,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139146689] [2025-03-04 10:43:16,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139146689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:43:16,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:43:16,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 10:43:16,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868836829] [2025-03-04 10:43:16,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:43:16,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 10:43:16,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:16,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 10:43:16,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 10:43:16,826 INFO L87 Difference]: Start difference. First operand 58 states and 64 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:16,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:16,888 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2025-03-04 10:43:16,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 10:43:16,888 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2025-03-04 10:43:16,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:16,888 INFO L225 Difference]: With dead ends: 91 [2025-03-04 10:43:16,889 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 10:43:16,889 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-04 10:43:16,889 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:16,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 155 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:16,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 10:43:16,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 10:43:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 52 states have (on average 1.0961538461538463) internal successors, (57), 53 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:16,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-03-04 10:43:16,893 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 55 [2025-03-04 10:43:16,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:16,893 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-03-04 10:43:16,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 10:43:16,893 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-03-04 10:43:16,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 10:43:16,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:16,894 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:16,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 10:43:16,894 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:16,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:16,894 INFO L85 PathProgramCache]: Analyzing trace with hash 889040137, now seen corresponding path program 1 times [2025-03-04 10:43:16,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:16,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018319208] [2025-03-04 10:43:16,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:16,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:16,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:43:16,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:43:16,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:16,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:17,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018319208] [2025-03-04 10:43:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018319208] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:17,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227086836] [2025-03-04 10:43:17,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:17,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:17,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:17,040 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:17,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 10:43:17,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 10:43:17,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 10:43:17,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:17,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:17,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 10:43:17,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:17,207 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:17,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:17,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227086836] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:17,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-04 10:43:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916549298] [2025-03-04 10:43:17,324 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:17,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 10:43:17,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:17,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 10:43:17,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:43:17,325 INFO L87 Difference]: Start difference. First operand 58 states and 63 transitions. Second operand has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:17,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:17,377 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2025-03-04 10:43:17,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 10:43:17,377 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 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 58 [2025-03-04 10:43:17,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:17,378 INFO L225 Difference]: With dead ends: 85 [2025-03-04 10:43:17,378 INFO L226 Difference]: Without dead ends: 71 [2025-03-04 10:43:17,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-04 10:43:17,379 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:17,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 272 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:17,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-04 10:43:17,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-04 10:43:17,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 64 states have (on average 1.0625) internal successors, (68), 65 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-03-04 10:43:17,385 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 58 [2025-03-04 10:43:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:17,385 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-03-04 10:43:17,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6842105263157894) internal successors, (70), 20 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:17,386 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-03-04 10:43:17,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 10:43:17,386 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:17,386 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:17,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:17,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-04 10:43:17,587 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:17,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:17,588 INFO L85 PathProgramCache]: Analyzing trace with hash -589465714, now seen corresponding path program 1 times [2025-03-04 10:43:17,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:17,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814832276] [2025-03-04 10:43:17,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:17,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:17,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:43:17,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:43:17,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:17,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:17,816 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:17,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:17,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814832276] [2025-03-04 10:43:17,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814832276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:17,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807904077] [2025-03-04 10:43:17,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:17,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:17,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:17,818 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:17,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 10:43:17,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 10:43:17,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 10:43:17,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:17,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:17,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 10:43:17,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:18,024 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:18,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:18,256 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:18,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807904077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:18,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:18,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-04 10:43:18,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115713931] [2025-03-04 10:43:18,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:18,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 10:43:18,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:18,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 10:43:18,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:43:18,258 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 32 states, 31 states have (on average 3.161290322580645) internal successors, (98), 32 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:18,320 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2025-03-04 10:43:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 10:43:18,320 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.161290322580645) internal successors, (98), 32 states have internal predecessors, (98), 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 72 [2025-03-04 10:43:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:18,321 INFO L225 Difference]: With dead ends: 123 [2025-03-04 10:43:18,321 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 10:43:18,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-04 10:43:18,322 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 30 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:18,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 294 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:43:18,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 10:43:18,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2025-03-04 10:43:18,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 102 states have (on average 1.107843137254902) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:18,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2025-03-04 10:43:18,329 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 72 [2025-03-04 10:43:18,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:18,329 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-03-04 10:43:18,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.161290322580645) internal successors, (98), 32 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:18,329 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2025-03-04 10:43:18,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 10:43:18,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:18,330 INFO L218 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:18,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:18,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 10:43:18,531 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:18,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:18,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1999018697, now seen corresponding path program 2 times [2025-03-04 10:43:18,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:18,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019884398] [2025-03-04 10:43:18,531 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:18,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:18,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-04 10:43:18,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:43:18,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:18,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:18,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019884398] [2025-03-04 10:43:18,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019884398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:18,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759094842] [2025-03-04 10:43:18,802 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:18,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:18,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:18,831 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:18,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 10:43:18,934 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-04 10:43:18,991 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 10:43:18,991 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:18,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:18,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 10:43:18,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:19,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:19,333 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759094842] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:19,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 35 [2025-03-04 10:43:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414085635] [2025-03-04 10:43:19,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:19,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 10:43:19,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:19,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 10:43:19,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:43:19,335 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 36 states, 35 states have (on average 3.142857142857143) internal successors, (110), 36 states have internal predecessors, (110), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:19,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:19,411 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-04 10:43:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 10:43:19,412 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.142857142857143) internal successors, (110), 36 states have internal predecessors, (110), 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 78 [2025-03-04 10:43:19,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:19,412 INFO L225 Difference]: With dead ends: 132 [2025-03-04 10:43:19,412 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 10:43:19,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 10:43:19,414 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:19,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 351 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:19,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 10:43:19,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-04 10:43:19,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 104 states have (on average 1.0384615384615385) internal successors, (108), 105 states have internal predecessors, (108), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:19,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-03-04 10:43:19,421 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 78 [2025-03-04 10:43:19,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:19,421 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-03-04 10:43:19,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.142857142857143) internal successors, (110), 36 states have internal predecessors, (110), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-03-04 10:43:19,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 10:43:19,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:19,422 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:19,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:19,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 10:43:19,623 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:19,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:19,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1127273230, now seen corresponding path program 2 times [2025-03-04 10:43:19,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:19,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202769301] [2025-03-04 10:43:19,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:19,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:19,637 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-04 10:43:19,651 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 10:43:19,651 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:19,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:20,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202769301] [2025-03-04 10:43:20,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202769301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:20,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061663394] [2025-03-04 10:43:20,232 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:20,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:20,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:20,234 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:20,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 10:43:20,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-04 10:43:20,437 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 10:43:20,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:20,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:20,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 10:43:20,444 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:20,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:21,309 INFO L134 CoverageAnalysis]: Checked inductivity of 547 backedges. 0 proven. 525 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 10:43:21,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061663394] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:21,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:21,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 63 [2025-03-04 10:43:21,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970336219] [2025-03-04 10:43:21,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:21,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-04 10:43:21,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:21,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-04 10:43:21,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:43:21,312 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 64 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 64 states have internal predecessors, (178), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:21,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:21,453 INFO L93 Difference]: Finished difference Result 219 states and 253 transitions. [2025-03-04 10:43:21,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-04 10:43:21,454 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 64 states have internal predecessors, (178), 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 112 [2025-03-04 10:43:21,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:21,455 INFO L225 Difference]: With dead ends: 219 [2025-03-04 10:43:21,455 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 10:43:21,456 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1239 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2025-03-04 10:43:21,456 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 74 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:21,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 425 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 10:43:21,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 188. [2025-03-04 10:43:21,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 182 states have (on average 1.1043956043956045) internal successors, (201), 183 states have internal predecessors, (201), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:21,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2025-03-04 10:43:21,462 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 112 [2025-03-04 10:43:21,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:21,462 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2025-03-04 10:43:21,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 2.8253968253968256) internal successors, (178), 64 states have internal predecessors, (178), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2025-03-04 10:43:21,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 10:43:21,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:21,463 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:21,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:21,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 10:43:21,668 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:21,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -580430263, now seen corresponding path program 3 times [2025-03-04 10:43:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58303794] [2025-03-04 10:43:21,668 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:43:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:21,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 16 equivalence classes. [2025-03-04 10:43:21,697 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 53 of 118 statements. [2025-03-04 10:43:21,698 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:43:21,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2025-03-04 10:43:22,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:22,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58303794] [2025-03-04 10:43:22,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58303794] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:22,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064452493] [2025-03-04 10:43:22,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:43:22,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:22,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:22,220 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:22,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 10:43:22,344 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 16 equivalence classes. [2025-03-04 10:43:22,405 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 53 of 118 statements. [2025-03-04 10:43:22,405 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 10:43:22,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:22,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-04 10:43:22,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:22,484 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-04 10:43:22,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 10:43:22,679 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 4 [2025-03-04 10:43:22,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-03-04 10:43:22,703 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_node_create_~temp~0#1.base_67| Int)) (and (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |v_node_create_~temp~0#1.base_67| (select |c_#memory_$Pointer$#1.base| |v_node_create_~temp~0#1.base_67|))) (= (select |c_old(#valid)| |v_node_create_~temp~0#1.base_67|) 0))) is different from true [2025-03-04 10:43:22,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:43:22,729 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 27 treesize of output 22 [2025-03-04 10:43:22,757 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 10:43:22,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 10:43:22,832 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 36 treesize of output 8 [2025-03-04 10:43:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 556 trivial. 4 not checked. [2025-03-04 10:43:22,856 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:22,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1064452493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:22,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 10:43:22,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2025-03-04 10:43:22,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786095367] [2025-03-04 10:43:22,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:22,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 10:43:22,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:22,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 10:43:22,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=903, Unknown=2, NotChecked=60, Total=1056 [2025-03-04 10:43:22,963 INFO L87 Difference]: Start difference. First operand 188 states and 207 transitions. Second operand has 31 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 26 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:43:23,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:23,334 INFO L93 Difference]: Finished difference Result 355 states and 391 transitions. [2025-03-04 10:43:23,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 10:43:23,335 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 26 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 118 [2025-03-04 10:43:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:23,337 INFO L225 Difference]: With dead ends: 355 [2025-03-04 10:43:23,337 INFO L226 Difference]: Without dead ends: 191 [2025-03-04 10:43:23,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=1414, Unknown=2, NotChecked=76, Total=1640 [2025-03-04 10:43:23,338 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 21 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:23,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 508 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 390 Invalid, 0 Unknown, 44 Unchecked, 0.2s Time] [2025-03-04 10:43:23,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-04 10:43:23,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2025-03-04 10:43:23,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 184 states have (on average 1.1032608695652173) internal successors, (203), 185 states have internal predecessors, (203), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:23,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2025-03-04 10:43:23,345 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 118 [2025-03-04 10:43:23,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:23,346 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2025-03-04 10:43:23,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 26 states have internal predecessors, (62), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 10:43:23,346 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2025-03-04 10:43:23,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 10:43:23,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:23,347 INFO L218 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:23,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:23,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 10:43:23,547 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:23,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:23,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1266577016, now seen corresponding path program 1 times [2025-03-04 10:43:23,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:23,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865000799] [2025-03-04 10:43:23,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:23,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:23,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 10:43:23,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:43:23,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:23,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:24,145 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:24,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865000799] [2025-03-04 10:43:24,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865000799] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:24,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2120715343] [2025-03-04 10:43:24,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:24,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:24,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:24,148 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:24,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 10:43:24,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 10:43:24,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 10:43:24,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:24,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:24,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 10:43:24,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:24,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 579 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:25,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2120715343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:25,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:25,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 67 [2025-03-04 10:43:25,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151042003] [2025-03-04 10:43:25,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:25,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-04 10:43:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:25,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-04 10:43:25,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=3429, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 10:43:25,227 INFO L87 Difference]: Start difference. First operand 190 states and 209 transitions. Second operand has 68 states, 67 states have (on average 2.8507462686567164) internal successors, (191), 68 states have internal predecessors, (191), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:25,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:25,348 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2025-03-04 10:43:25,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-04 10:43:25,349 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 67 states have (on average 2.8507462686567164) internal successors, (191), 68 states have internal predecessors, (191), 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 120 [2025-03-04 10:43:25,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:25,350 INFO L225 Difference]: With dead ends: 230 [2025-03-04 10:43:25,350 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 10:43:25,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1127, Invalid=3429, Unknown=0, NotChecked=0, Total=4556 [2025-03-04 10:43:25,351 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 78 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:25,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 306 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:43:25,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 10:43:25,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2025-03-04 10:43:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 186 states have (on average 1.021505376344086) internal successors, (190), 187 states have internal predecessors, (190), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 196 transitions. [2025-03-04 10:43:25,358 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 196 transitions. Word has length 120 [2025-03-04 10:43:25,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:25,358 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 196 transitions. [2025-03-04 10:43:25,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 67 states have (on average 2.8507462686567164) internal successors, (191), 68 states have internal predecessors, (191), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 196 transitions. [2025-03-04 10:43:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-04 10:43:25,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:25,360 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 31, 31, 30, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:25,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 10:43:25,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:25,560 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:25,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:25,561 INFO L85 PathProgramCache]: Analyzing trace with hash -893121907, now seen corresponding path program 1 times [2025-03-04 10:43:25,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:25,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027371263] [2025-03-04 10:43:25,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:25,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:25,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 10:43:25,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 10:43:25,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:25,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:27,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 0 proven. 2325 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:27,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027371263] [2025-03-04 10:43:27,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027371263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:27,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789703513] [2025-03-04 10:43:27,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:43:27,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:27,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:27,358 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:27,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 10:43:27,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-04 10:43:27,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-04 10:43:27,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:43:27,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:27,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-04 10:43:27,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 0 proven. 2325 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:27,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2349 backedges. 0 proven. 2325 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:30,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789703513] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:30,107 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:30,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 127 [2025-03-04 10:43:30,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776392356] [2025-03-04 10:43:30,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:30,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-04 10:43:30,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:30,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-04 10:43:30,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2025-03-04 10:43:30,112 INFO L87 Difference]: Start difference. First operand 192 states and 196 transitions. Second operand has 128 states, 127 states have (on average 2.6692913385826773) internal successors, (339), 128 states have internal predecessors, (339), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:30,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:30,408 INFO L93 Difference]: Finished difference Result 413 states and 479 transitions. [2025-03-04 10:43:30,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2025-03-04 10:43:30,408 INFO L78 Accepts]: Start accepts. Automaton has has 128 states, 127 states have (on average 2.6692913385826773) internal successors, (339), 128 states have internal predecessors, (339), 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 194 [2025-03-04 10:43:30,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:30,410 INFO L225 Difference]: With dead ends: 413 [2025-03-04 10:43:30,410 INFO L226 Difference]: Without dead ends: 412 [2025-03-04 10:43:30,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5047 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2025-03-04 10:43:30,413 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 264 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:30,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 441 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:43:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-04 10:43:30,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 350. [2025-03-04 10:43:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 344 states have (on average 1.1017441860465116) internal successors, (379), 345 states have internal predecessors, (379), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:30,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 385 transitions. [2025-03-04 10:43:30,422 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 385 transitions. Word has length 194 [2025-03-04 10:43:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:30,423 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 385 transitions. [2025-03-04 10:43:30,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 128 states, 127 states have (on average 2.6692913385826773) internal successors, (339), 128 states have internal predecessors, (339), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 385 transitions. [2025-03-04 10:43:30,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-04 10:43:30,424 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:30,424 INFO L218 NwaCegarLoop]: trace histogram [32, 31, 31, 31, 31, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:30,432 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 10:43:30,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:30,625 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:30,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:30,625 INFO L85 PathProgramCache]: Analyzing trace with hash -542330232, now seen corresponding path program 2 times [2025-03-04 10:43:30,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:30,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665900635] [2025-03-04 10:43:30,625 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:30,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:30,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-03-04 10:43:30,655 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 10:43:30,656 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:30,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:32,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:32,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665900635] [2025-03-04 10:43:32,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665900635] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:32,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414528105] [2025-03-04 10:43:32,496 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:32,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:32,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:32,498 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:32,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 10:43:32,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-03-04 10:43:32,745 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-03-04 10:43:32,745 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:32,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:32,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-04 10:43:32,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:32,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:32,934 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:35,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2387 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:35,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414528105] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:35,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:35,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 131 [2025-03-04 10:43:35,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947229958] [2025-03-04 10:43:35,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:35,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-03-04 10:43:35,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:35,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-03-04 10:43:35,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=12997, Unknown=0, NotChecked=0, Total=17292 [2025-03-04 10:43:35,209 INFO L87 Difference]: Start difference. First operand 350 states and 385 transitions. Second operand has 132 states, 131 states have (on average 2.6793893129770994) internal successors, (351), 132 states have internal predecessors, (351), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:35,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:35,464 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2025-03-04 10:43:35,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-04 10:43:35,465 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 131 states have (on average 2.6793893129770994) internal successors, (351), 132 states have internal predecessors, (351), 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 200 [2025-03-04 10:43:35,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:35,466 INFO L225 Difference]: With dead ends: 422 [2025-03-04 10:43:35,466 INFO L226 Difference]: Without dead ends: 353 [2025-03-04 10:43:35,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5395 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4295, Invalid=12997, Unknown=0, NotChecked=0, Total=17292 [2025-03-04 10:43:35,468 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 160 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:35,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 432 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 10:43:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-04 10:43:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2025-03-04 10:43:35,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 346 states have (on average 1.0115606936416186) internal successors, (350), 347 states have internal predecessors, (350), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:35,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 356 transitions. [2025-03-04 10:43:35,478 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 356 transitions. Word has length 200 [2025-03-04 10:43:35,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:35,478 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 356 transitions. [2025-03-04 10:43:35,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 131 states have (on average 2.6793893129770994) internal successors, (351), 132 states have internal predecessors, (351), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:35,479 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 356 transitions. [2025-03-04 10:43:35,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-04 10:43:35,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:35,481 INFO L218 NwaCegarLoop]: trace histogram [63, 63, 63, 63, 62, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:35,489 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 10:43:35,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:35,681 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:35,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:35,682 INFO L85 PathProgramCache]: Analyzing trace with hash 657837197, now seen corresponding path program 2 times [2025-03-04 10:43:35,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:35,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882524862] [2025-03-04 10:43:35,682 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:35,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:35,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 354 statements into 2 equivalence classes. [2025-03-04 10:43:35,754 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 10:43:35,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:35,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 9765 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882524862] [2025-03-04 10:43:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882524862] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141818626] [2025-03-04 10:43:41,314 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:43:41,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:41,316 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:41,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 10:43:41,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 354 statements into 2 equivalence classes. [2025-03-04 10:43:41,684 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 354 of 354 statements. [2025-03-04 10:43:41,684 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 10:43:41,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:41,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 1782 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-04 10:43:41,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:42,032 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 9765 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:42,032 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:43:50,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9789 backedges. 0 proven. 9765 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 10:43:50,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141818626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:43:50,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:43:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 255 [2025-03-04 10:43:50,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448894489] [2025-03-04 10:43:50,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:43:50,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 256 states [2025-03-04 10:43:50,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:43:50,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2025-03-04 10:43:50,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16511, Invalid=48769, Unknown=0, NotChecked=0, Total=65280 [2025-03-04 10:43:50,564 INFO L87 Difference]: Start difference. First operand 352 states and 356 transitions. Second operand has 256 states, 255 states have (on average 2.5843137254901962) internal successors, (659), 256 states have internal predecessors, (659), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:43:51,423 INFO L93 Difference]: Finished difference Result 797 states and 927 transitions. [2025-03-04 10:43:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2025-03-04 10:43:51,424 INFO L78 Accepts]: Start accepts. Automaton has has 256 states, 255 states have (on average 2.5843137254901962) internal successors, (659), 256 states have internal predecessors, (659), 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 354 [2025-03-04 10:43:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:43:51,426 INFO L225 Difference]: With dead ends: 797 [2025-03-04 10:43:51,426 INFO L226 Difference]: Without dead ends: 796 [2025-03-04 10:43:51,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20343 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=16511, Invalid=48769, Unknown=0, NotChecked=0, Total=65280 [2025-03-04 10:43:51,431 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 430 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 10:43:51,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 699 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 10:43:51,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-04 10:43:51,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 670. [2025-03-04 10:43:51,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 664 states have (on average 1.1009036144578312) internal successors, (731), 665 states have internal predecessors, (731), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:43:51,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 737 transitions. [2025-03-04 10:43:51,448 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 737 transitions. Word has length 354 [2025-03-04 10:43:51,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:43:51,449 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 737 transitions. [2025-03-04 10:43:51,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 256 states, 255 states have (on average 2.5843137254901962) internal successors, (659), 256 states have internal predecessors, (659), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 10:43:51,449 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 737 transitions. [2025-03-04 10:43:51,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-04 10:43:51,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:43:51,453 INFO L218 NwaCegarLoop]: trace histogram [64, 63, 63, 63, 63, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:43:51,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 10:43:51,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:51,653 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2025-03-04 10:43:51,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:43:51,654 INFO L85 PathProgramCache]: Analyzing trace with hash -599460728, now seen corresponding path program 3 times [2025-03-04 10:43:51,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:43:51,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697074544] [2025-03-04 10:43:51,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:43:51,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:43:51,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 360 statements into 64 equivalence classes. [2025-03-04 10:43:51,724 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 105 of 360 statements. [2025-03-04 10:43:51,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-04 10:43:51,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 9915 backedges. 746 proven. 19 refuted. 0 times theorem prover too weak. 9150 trivial. 0 not checked. [2025-03-04 10:43:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:43:53,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697074544] [2025-03-04 10:43:53,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697074544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:43:53,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808415003] [2025-03-04 10:43:53,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 10:43:53,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:43:53,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:43:53,763 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:43:53,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 10:43:53,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 360 statements into 64 equivalence classes. [2025-03-04 10:43:54,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 105 of 360 statements. [2025-03-04 10:43:54,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-04 10:43:54,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:43:54,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-03-04 10:43:54,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:43:54,610 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-04 10:43:54,655 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-04 10:43:54,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 treesize of output 3 [2025-03-04 10:43:54,797 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 11 treesize of output 3 [2025-03-04 10:43:54,937 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-04 10:43:54,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2025-03-04 10:43:55,040 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 10:43:55,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-04 10:43:55,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2025-03-04 10:43:55,763 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2025-03-04 10:43:55,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 190 treesize of output 110 [2025-03-04 10:43:55,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 23 [2025-03-04 10:43:55,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 10:43:55,786 INFO L349 Elim1Store]: treesize reduction 69, result has 21.6 percent of original size [2025-03-04 10:43:55,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 52 [2025-03-04 10:43:55,892 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 143 treesize of output 99 [2025-03-04 10:43:56,396 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-03-04 10:43:56,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 160 treesize of output 172 [2025-03-04 10:43:57,241 INFO L349 Elim1Store]: treesize reduction 72, result has 83.7 percent of original size [2025-03-04 10:43:57,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 17 new quantified variables, introduced 55 case distinctions, treesize of input 181 treesize of output 463 [2025-03-04 10:43:57,355 INFO L349 Elim1Store]: treesize reduction 56, result has 66.9 percent of original size [2025-03-04 10:43:57,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 81 treesize of output 165