./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 e2fb8bed 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-?-e2fb8be-m [2025-03-09 01:55:44,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 01:55:44,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 01:55:44,731 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 01:55:44,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 01:55:44,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 01:55:44,753 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 01:55:44,753 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 01:55:44,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 01:55:44,754 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 01:55:44,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 01:55:44,755 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 01:55:44,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 01:55:44,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 01:55:44,755 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 01:55:44,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 01:55:44,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 01:55:44,756 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 01:55:44,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 01:55:44,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 01:55:44,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 01:55:44,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 01:55:44,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 01:55:44,756 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 01:55:44,756 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 01:55:44,757 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 01:55:44,757 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 01:55:44,757 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 01:55:44,757 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 01:55:44,757 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 01:55:44,757 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 01:55:44,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 01:55:44,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 01:55:44,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 01:55:44,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:55:44,758 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 01:55:44,758 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 01:55:44,758 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 01:55:44,758 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 01:55:44,758 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 01:55:44,758 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 01:55:44,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 01:55:44,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 01:55:44,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 01:55:44,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 01:55:44,759 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-09 01:55:44,976 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 01:55:44,985 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 01:55:44,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 01:55:44,987 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 01:55:44,988 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 01:55:44,988 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-09 01:55:46,098 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69021ac16/ea6d1d14edf7442c946bd8891d1dfceb/FLAG650701ee3 [2025-03-09 01:55:46,401 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 01:55:46,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_append_unequal.i [2025-03-09 01:55:46,425 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69021ac16/ea6d1d14edf7442c946bd8891d1dfceb/FLAG650701ee3 [2025-03-09 01:55:46,675 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69021ac16/ea6d1d14edf7442c946bd8891d1dfceb [2025-03-09 01:55:46,677 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 01:55:46,679 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 01:55:46,680 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 01:55:46,680 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 01:55:46,683 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 01:55:46,683 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:55:46" (1/1) ... [2025-03-09 01:55:46,684 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41b72b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:46, skipping insertion in model container [2025-03-09 01:55:46,684 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 01:55:46" (1/1) ... [2025-03-09 01:55:46,701 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 01:55:46,928 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:55:46,937 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 01:55:46,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 01:55:47,002 INFO L204 MainTranslator]: Completed translation [2025-03-09 01:55:47,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47 WrapperNode [2025-03-09 01:55:47,003 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 01:55:47,004 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 01:55:47,004 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 01:55:47,004 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 01:55:47,009 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,019 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,039 INFO L138 Inliner]: procedures = 127, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 139 [2025-03-09 01:55:47,040 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 01:55:47,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 01:55:47,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 01:55:47,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 01:55:47,046 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,049 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,067 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-09 01:55:47,068 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,068 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,075 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,076 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,077 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 01:55:47,084 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 01:55:47,084 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 01:55:47,084 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 01:55:47,084 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (1/1) ... [2025-03-09 01:55:47,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 01:55:47,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:47,106 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-09 01:55:47,108 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-09 01:55:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 01:55:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 01:55:47,125 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-09 01:55:47,126 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 01:55:47,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 01:55:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 01:55:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 01:55:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-09 01:55:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-09 01:55:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-09 01:55:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 01:55:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 01:55:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 01:55:47,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 01:55:47,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 01:55:47,244 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 01:55:47,246 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 01:55:47,427 INFO L1307 $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-09 01:55:47,445 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-09 01:55:47,458 INFO L? ?]: Removed 58 outVars from TransFormulas that were not future-live. [2025-03-09 01:55:47,458 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 01:55:47,466 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 01:55:47,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 01:55:47,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:55:47 BoogieIcfgContainer [2025-03-09 01:55:47,468 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 01:55:47,471 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 01:55:47,471 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 01:55:47,474 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 01:55:47,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 01:55:46" (1/3) ... [2025-03-09 01:55:47,475 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff9108f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:55:47, skipping insertion in model container [2025-03-09 01:55:47,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 01:55:47" (2/3) ... [2025-03-09 01:55:47,476 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ff9108f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 01:55:47, skipping insertion in model container [2025-03-09 01:55:47,476 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 01:55:47" (3/3) ... [2025-03-09 01:55:47,477 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2025-03-09 01:55:47,488 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 01:55:47,489 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-09 01:55:47,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 01:55:47,540 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;@3cf9ae2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 01:55:47,542 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-09 01:55:47,546 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-09 01:55:47,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-09 01:55:47,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:47,551 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 01:55:47,552 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-09 01:55:47,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:47,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1386262017, now seen corresponding path program 1 times [2025-03-09 01:55:47,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:47,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936109845] [2025-03-09 01:55:47,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:47,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:47,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 01:55:47,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 01:55:47,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:47,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:47,813 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-09 01:55:47,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:47,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936109845] [2025-03-09 01:55:47,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936109845] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:47,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:47,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:47,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610679270] [2025-03-09 01:55:47,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:47,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:47,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:47,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:47,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:47,835 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-09 01:55:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:47,884 INFO L93 Difference]: Finished difference Result 97 states and 123 transitions. [2025-03-09 01:55:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:47,887 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-09 01:55:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:47,892 INFO L225 Difference]: With dead ends: 97 [2025-03-09 01:55:47,892 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:55:47,895 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-09 01:55:47,897 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-09 01:55:47,898 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-09 01:55:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:55:47,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 01:55:47,925 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-09 01:55:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-03-09 01:55:47,930 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 11 [2025-03-09 01:55:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:47,950 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-09 01:55:47,951 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-09 01:55:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-03-09 01:55:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-09 01:55:47,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:47,953 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 01:55:47,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 01:55:47,953 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-09 01:55:47,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:47,954 INFO L85 PathProgramCache]: Analyzing trace with hash 456794239, now seen corresponding path program 1 times [2025-03-09 01:55:47,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:47,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108046555] [2025-03-09 01:55:47,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:47,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:47,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 01:55:47,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 01:55:47,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:47,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:48,083 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-09 01:55:48,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:48,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108046555] [2025-03-09 01:55:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108046555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:48,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:48,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:48,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066277232] [2025-03-09 01:55:48,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:48,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:48,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:48,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:48,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:48,088 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-09 01:55:48,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:48,116 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-03-09 01:55:48,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:48,116 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-09 01:55:48,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:48,117 INFO L225 Difference]: With dead ends: 45 [2025-03-09 01:55:48,117 INFO L226 Difference]: Without dead ends: 44 [2025-03-09 01:55:48,117 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-09 01:55:48,118 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-09 01:55:48,118 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-09 01:55:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-09 01:55:48,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-09 01:55:48,121 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-09 01:55:48,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2025-03-09 01:55:48,122 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2025-03-09 01:55:48,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:48,122 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2025-03-09 01:55:48,123 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-09 01:55:48,123 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2025-03-09 01:55:48,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 01:55:48,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:48,123 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-09 01:55:48,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 01:55:48,124 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-09 01:55:48,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:48,124 INFO L85 PathProgramCache]: Analyzing trace with hash 1275719553, now seen corresponding path program 1 times [2025-03-09 01:55:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:48,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651425952] [2025-03-09 01:55:48,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:48,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:48,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:55:48,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:55:48,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:48,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:48,249 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-09 01:55:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:48,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651425952] [2025-03-09 01:55:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651425952] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:48,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [589411048] [2025-03-09 01:55:48,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:48,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:48,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:48,253 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-09 01:55:48,255 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-09 01:55:48,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 01:55:48,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 01:55:48,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:48,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:48,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-09 01:55:48,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:48,422 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-09 01:55:48,422 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:48,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [589411048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:48,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:48,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 01:55:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651132067] [2025-03-09 01:55:48,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:48,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 01:55:48,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:48,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 01:55:48,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 01:55:48,424 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-09 01:55:48,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:48,456 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2025-03-09 01:55:48,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 01:55:48,458 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-09 01:55:48,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:48,459 INFO L225 Difference]: With dead ends: 44 [2025-03-09 01:55:48,459 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 01:55:48,459 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-09 01:55:48,459 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-09 01:55:48,459 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-09 01:55:48,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 01:55:48,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2025-03-09 01:55:48,464 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-09 01:55:48,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-09 01:55:48,465 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 22 [2025-03-09 01:55:48,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:48,465 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-09 01:55:48,465 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-09 01:55:48,465 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-09 01:55:48,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 01:55:48,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:48,466 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-09 01:55:48,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 01:55:48,671 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-09 01:55:48,671 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-09 01:55:48,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:48,672 INFO L85 PathProgramCache]: Analyzing trace with hash 656297219, now seen corresponding path program 1 times [2025-03-09 01:55:48,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:48,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110468752] [2025-03-09 01:55:48,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:48,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:48,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:55:48,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:55:48,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:48,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:48,777 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-09 01:55:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110468752] [2025-03-09 01:55:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110468752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893657982] [2025-03-09 01:55:48,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:48,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:48,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:48,781 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-09 01:55:48,782 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-09 01:55:48,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 01:55:48,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 01:55:48,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:48,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:48,880 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 01:55:48,882 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:48,910 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-09 01:55:48,910 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893657982] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:48,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-09 01:55:48,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168172313] [2025-03-09 01:55:48,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:48,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:55:48,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:48,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:55:48,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:55:48,912 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-09 01:55:48,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:48,922 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2025-03-09 01:55:48,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:55:48,923 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-09 01:55:48,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:48,924 INFO L225 Difference]: With dead ends: 39 [2025-03-09 01:55:48,924 INFO L226 Difference]: Without dead ends: 38 [2025-03-09 01:55:48,924 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-09 01:55:48,925 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-09 01:55:48,925 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-09 01:55:48,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-09 01:55:48,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-09 01:55:48,929 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-09 01:55:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-09 01:55:48,929 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 25 [2025-03-09 01:55:48,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:48,929 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-09 01:55:48,929 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-09 01:55:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-09 01:55:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-09 01:55:48,930 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:48,930 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-09 01:55:48,937 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-09 01:55:49,133 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-09 01:55:49,133 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-09 01:55:49,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:49,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1129622705, now seen corresponding path program 1 times [2025-03-09 01:55:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010026399] [2025-03-09 01:55:49,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:49,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:55:49,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:55:49,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:49,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:49,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-09 01:55:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:49,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010026399] [2025-03-09 01:55:49,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010026399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:49,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498730093] [2025-03-09 01:55:49,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:49,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:49,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:49,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-09 01:55:49,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-09 01:55:49,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-09 01:55:49,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-09 01:55:49,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:49,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:49,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 01:55:49,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:49,360 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-09 01:55:49,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:49,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498730093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:49,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:49,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-09 01:55:49,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784931020] [2025-03-09 01:55:49,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:49,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 01:55:49,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:49,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 01:55:49,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 01:55:49,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-09 01:55:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:49,366 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-09 01:55:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 01:55:49,366 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-09 01:55:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:49,367 INFO L225 Difference]: With dead ends: 38 [2025-03-09 01:55:49,367 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 01:55:49,367 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-09 01:55:49,368 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-09 01:55:49,368 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-09 01:55:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 01:55:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 01:55:49,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-09 01:55:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2025-03-09 01:55:49,371 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 26 [2025-03-09 01:55:49,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:49,371 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2025-03-09 01:55:49,371 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-09 01:55:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2025-03-09 01:55:49,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-09 01:55:49,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:49,372 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-09 01:55:49,378 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-09 01:55:49,576 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-09 01:55:49,576 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-09 01:55:49,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:49,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1059152873, now seen corresponding path program 1 times [2025-03-09 01:55:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:49,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605383086] [2025-03-09 01:55:49,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:49,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:49,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:55:49,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:55:49,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:49,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:49,663 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-09 01:55:49,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605383086] [2025-03-09 01:55:49,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605383086] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:49,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107792390] [2025-03-09 01:55:49,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:49,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:49,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:49,666 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-09 01:55:49,667 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-09 01:55:49,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-09 01:55:49,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-09 01:55:49,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:49,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:49,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 01:55:49,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:49,784 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-09 01:55:49,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:49,819 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-09 01:55:49,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107792390] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:49,821 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:49,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-09 01:55:49,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441183671] [2025-03-09 01:55:49,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:49,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 01:55:49,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:49,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 01:55:49,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-09 01:55:49,822 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-09 01:55:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:49,851 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2025-03-09 01:55:49,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:55:49,854 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-09 01:55:49,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:49,854 INFO L225 Difference]: With dead ends: 67 [2025-03-09 01:55:49,854 INFO L226 Difference]: Without dead ends: 40 [2025-03-09 01:55:49,854 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-09 01:55:49,855 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-09 01:55:49,855 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-09 01:55:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-09 01:55:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-09 01:55:49,861 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-09 01:55:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2025-03-09 01:55:49,861 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 28 [2025-03-09 01:55:49,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:49,861 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2025-03-09 01:55:49,861 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-09 01:55:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2025-03-09 01:55:49,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-09 01:55:49,862 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:49,862 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-09 01:55:49,869 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-09 01:55:50,062 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-09 01:55:50,063 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-09 01:55:50,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:50,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1385339543, now seen corresponding path program 2 times [2025-03-09 01:55:50,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:50,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576777735] [2025-03-09 01:55:50,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:50,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:50,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-09 01:55:50,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 18 of 38 statements. [2025-03-09 01:55:50,083 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:55:50,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:50,110 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-09 01:55:50,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:50,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576777735] [2025-03-09 01:55:50,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576777735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:50,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:50,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:50,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373429462] [2025-03-09 01:55:50,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:50,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:50,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:50,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:50,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:50,112 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-09 01:55:50,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:50,135 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2025-03-09 01:55:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:50,136 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-09 01:55:50,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:50,136 INFO L225 Difference]: With dead ends: 49 [2025-03-09 01:55:50,136 INFO L226 Difference]: Without dead ends: 47 [2025-03-09 01:55:50,136 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-09 01:55:50,137 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-09 01:55:50,137 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-09 01:55:50,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-09 01:55:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2025-03-09 01:55:50,143 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-09 01:55:50,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2025-03-09 01:55:50,143 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 38 [2025-03-09 01:55:50,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:50,143 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2025-03-09 01:55:50,143 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-09 01:55:50,143 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2025-03-09 01:55:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-09 01:55:50,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:50,144 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-09 01:55:50,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 01:55:50,144 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-09 01:55:50,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:50,144 INFO L85 PathProgramCache]: Analyzing trace with hash 4108555, now seen corresponding path program 1 times [2025-03-09 01:55:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563608471] [2025-03-09 01:55:50,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:50,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:50,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-09 01:55:50,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-09 01:55:50,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:50,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:50,231 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-09 01:55:50,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:50,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563608471] [2025-03-09 01:55:50,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563608471] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:50,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:50,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 01:55:50,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285872055] [2025-03-09 01:55:50,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:50,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 01:55:50,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:50,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 01:55:50,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 01:55:50,233 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-09 01:55:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:50,248 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2025-03-09 01:55:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:50,249 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-09 01:55:50,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:50,249 INFO L225 Difference]: With dead ends: 51 [2025-03-09 01:55:50,250 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 01:55:50,250 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-09 01:55:50,250 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-09 01:55:50,250 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-09 01:55:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 01:55:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-03-09 01:55:50,254 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-09 01:55:50,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-03-09 01:55:50,254 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 39 [2025-03-09 01:55:50,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:50,254 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-03-09 01:55:50,254 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-09 01:55:50,255 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-03-09 01:55:50,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-09 01:55:50,255 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:50,255 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-09 01:55:50,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 01:55:50,255 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-09 01:55:50,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:50,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1151554800, now seen corresponding path program 1 times [2025-03-09 01:55:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:50,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145860949] [2025-03-09 01:55:50,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:50,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:50,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:55:50,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:55:50,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:50,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:50,390 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-09 01:55:50,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:50,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145860949] [2025-03-09 01:55:50,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145860949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:50,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294352156] [2025-03-09 01:55:50,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:50,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:50,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:50,393 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-09 01:55:50,395 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-09 01:55:50,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-09 01:55:50,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-09 01:55:50,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:50,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:50,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:55:50,513 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:50,546 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-09 01:55:50,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294352156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:50,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-09 01:55:50,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97751771] [2025-03-09 01:55:50,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:50,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:55:50,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:50,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:55:50,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:55:50,547 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-09 01:55:50,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:50,563 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-03-09 01:55:50,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 01:55:50,564 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-09 01:55:50,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:50,564 INFO L225 Difference]: With dead ends: 45 [2025-03-09 01:55:50,564 INFO L226 Difference]: Without dead ends: 44 [2025-03-09 01:55:50,566 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-09 01:55:50,566 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-09 01:55:50,566 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-09 01:55:50,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-03-09 01:55:50,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-03-09 01:55:50,569 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-09 01:55:50,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-09 01:55:50,572 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 43 [2025-03-09 01:55:50,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:50,572 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-09 01:55:50,572 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-09 01:55:50,572 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-09 01:55:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 01:55:50,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:50,573 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-09 01:55:50,581 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-09 01:55:50,773 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-09 01:55:50,774 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-09 01:55:50,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:50,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1338499004, now seen corresponding path program 1 times [2025-03-09 01:55:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336014210] [2025-03-09 01:55:50,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:50,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:50,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 01:55:50,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:55:50,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:50,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:50,874 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-09 01:55:50,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:50,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336014210] [2025-03-09 01:55:50,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336014210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:50,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306411049] [2025-03-09 01:55:50,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:50,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:50,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:50,877 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-09 01:55:50,877 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-09 01:55:50,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 01:55:50,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:55:50,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:50,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:50,991 INFO L256 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 01:55:50,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:51,019 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-09 01:55:51,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 01:55:51,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1306411049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:51,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 01:55:51,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-09 01:55:51,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691057873] [2025-03-09 01:55:51,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:51,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 01:55:51,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:51,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 01:55:51,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:55:51,021 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-09 01:55:51,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:51,038 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-03-09 01:55:51,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 01:55:51,038 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-09 01:55:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:51,039 INFO L225 Difference]: With dead ends: 44 [2025-03-09 01:55:51,039 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 01:55:51,039 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-09 01:55:51,039 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-09 01:55:51,039 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-09 01:55:51,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 01:55:51,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 01:55:51,042 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-09 01:55:51,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2025-03-09 01:55:51,043 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 44 [2025-03-09 01:55:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:51,043 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2025-03-09 01:55:51,043 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-09 01:55:51,043 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2025-03-09 01:55:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-09 01:55:51,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:51,044 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-09 01:55:51,050 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-09 01:55:51,244 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-09 01:55:51,244 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-09 01:55:51,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:51,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1338460432, now seen corresponding path program 1 times [2025-03-09 01:55:51,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:51,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141312411] [2025-03-09 01:55:51,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:51,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:51,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 01:55:51,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:55:51,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:51,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:51,319 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-09 01:55:51,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:51,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141312411] [2025-03-09 01:55:51,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141312411] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:51,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [243950654] [2025-03-09 01:55:51,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:51,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:51,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:51,321 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-09 01:55:51,340 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-09 01:55:51,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-09 01:55:51,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-09 01:55:51,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:51,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:51,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:55:51,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:51,471 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-09 01:55:51,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:51,511 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-09 01:55:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [243950654] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:51,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:55:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301677642] [2025-03-09 01:55:51,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:51,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:55:51,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:51,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:55:51,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:55:51,513 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-09 01:55:51,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:51,541 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2025-03-09 01:55:51,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 01:55:51,541 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-09 01:55:51,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:51,542 INFO L225 Difference]: With dead ends: 65 [2025-03-09 01:55:51,542 INFO L226 Difference]: Without dead ends: 64 [2025-03-09 01:55:51,542 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-09 01:55:51,543 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-09 01:55:51,543 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-09 01:55:51,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-09 01:55:51,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2025-03-09 01:55:51,547 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-09 01:55:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 66 transitions. [2025-03-09 01:55:51,548 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 66 transitions. Word has length 44 [2025-03-09 01:55:51,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:51,548 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 66 transitions. [2025-03-09 01:55:51,548 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-09 01:55:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 66 transitions. [2025-03-09 01:55:51,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 01:55:51,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:51,550 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-09 01:55:51,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 01:55:51,751 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-09 01:55:51,751 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-09 01:55:51,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:51,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1456203826, now seen corresponding path program 1 times [2025-03-09 01:55:51,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:51,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5929607] [2025-03-09 01:55:51,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:51,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:51,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:55:51,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:55:51,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:51,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:51,820 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-09 01:55:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:51,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5929607] [2025-03-09 01:55:51,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5929607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:51,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744509963] [2025-03-09 01:55:51,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:51,823 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-09 01:55:51,824 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-09 01:55:51,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-09 01:55:51,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 01:55:51,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:51,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:51,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 01:55:51,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:51,969 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-09 01:55:51,969 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:52,033 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-09 01:55:52,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744509963] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:52,034 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:52,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-09 01:55:52,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492615126] [2025-03-09 01:55:52,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:52,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 01:55:52,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:52,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 01:55:52,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-03-09 01:55:52,035 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-09 01:55:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:52,080 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2025-03-09 01:55:52,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:55:52,081 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-09 01:55:52,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:52,081 INFO L225 Difference]: With dead ends: 67 [2025-03-09 01:55:52,081 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 01:55:52,082 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-09 01:55:52,082 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-09 01:55:52,082 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-09 01:55:52,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 01:55:52,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-09 01:55:52,090 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-09 01:55:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 64 transitions. [2025-03-09 01:55:52,091 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 64 transitions. Word has length 45 [2025-03-09 01:55:52,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:52,091 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 64 transitions. [2025-03-09 01:55:52,091 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-09 01:55:52,092 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 64 transitions. [2025-03-09 01:55:52,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-09 01:55:52,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:52,092 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-09 01:55:52,099 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 01:55:52,292 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-09 01:55:52,293 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-09 01:55:52,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:52,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1969075246, now seen corresponding path program 2 times [2025-03-09 01:55:52,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:52,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026702737] [2025-03-09 01:55:52,293 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:52,305 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 55 statements into 2 equivalence classes. [2025-03-09 01:55:52,311 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 55 statements. [2025-03-09 01:55:52,311 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 01:55:52,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:52,634 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-09 01:55:52,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:52,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026702737] [2025-03-09 01:55:52,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026702737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 01:55:52,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 01:55:52,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 01:55:52,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061464932] [2025-03-09 01:55:52,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 01:55:52,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 01:55:52,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:52,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 01:55:52,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 01:55:52,636 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-09 01:55:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:52,694 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2025-03-09 01:55:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 01:55:52,695 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-09 01:55:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:52,695 INFO L225 Difference]: With dead ends: 91 [2025-03-09 01:55:52,695 INFO L226 Difference]: Without dead ends: 58 [2025-03-09 01:55:52,696 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-09 01:55:52,696 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-09 01:55:52,696 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-09 01:55:52,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-09 01:55:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-09 01:55:52,699 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-09 01:55:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 63 transitions. [2025-03-09 01:55:52,699 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 63 transitions. Word has length 55 [2025-03-09 01:55:52,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:52,700 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 63 transitions. [2025-03-09 01:55:52,700 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-09 01:55:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 63 transitions. [2025-03-09 01:55:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-09 01:55:52,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:52,700 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-09 01:55:52,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 01:55:52,700 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-09 01:55:52,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:52,701 INFO L85 PathProgramCache]: Analyzing trace with hash 889040137, now seen corresponding path program 1 times [2025-03-09 01:55:52,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:52,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629106065] [2025-03-09 01:55:52,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:52,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 01:55:52,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:55:52,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:52,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:52,817 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-09 01:55:52,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629106065] [2025-03-09 01:55:52,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629106065] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:52,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921001097] [2025-03-09 01:55:52,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:52,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:52,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:52,819 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-09 01:55:52,821 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-09 01:55:52,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-09 01:55:52,961 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-09 01:55:52,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:52,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:52,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 01:55:52,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:53,001 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-09 01:55:53,001 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:53,110 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-09 01:55:53,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921001097] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:53,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:53,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2025-03-09 01:55:53,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705558034] [2025-03-09 01:55:53,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:53,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-09 01:55:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:53,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-09 01:55:53,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-03-09 01:55:53,112 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-09 01:55:53,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:53,157 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2025-03-09 01:55:53,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-09 01:55:53,157 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-09 01:55:53,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:53,158 INFO L225 Difference]: With dead ends: 85 [2025-03-09 01:55:53,158 INFO L226 Difference]: Without dead ends: 71 [2025-03-09 01:55:53,158 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-09 01:55:53,158 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-09 01:55:53,158 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-09 01:55:53,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-09 01:55:53,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2025-03-09 01:55:53,162 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-09 01:55:53,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-03-09 01:55:53,165 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 58 [2025-03-09 01:55:53,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:53,165 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-03-09 01:55:53,165 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-09 01:55:53,165 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-03-09 01:55:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-09 01:55:53,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:53,165 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-09 01:55:53,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 01:55:53,366 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-09 01:55:53,366 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-09 01:55:53,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:53,366 INFO L85 PathProgramCache]: Analyzing trace with hash -589465714, now seen corresponding path program 1 times [2025-03-09 01:55:53,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:53,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531101534] [2025-03-09 01:55:53,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:53,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:53,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 01:55:53,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 01:55:53,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:53,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:53,583 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-09 01:55:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:53,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531101534] [2025-03-09 01:55:53,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531101534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:53,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453054924] [2025-03-09 01:55:53,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:53,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:53,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:53,586 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-09 01:55:53,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 01:55:53,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-09 01:55:53,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-09 01:55:53,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:53,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:53,735 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 01:55:53,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:53,791 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-09 01:55:53,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:54,011 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-09 01:55:54,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453054924] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:54,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:54,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 31 [2025-03-09 01:55:54,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046736330] [2025-03-09 01:55:54,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:54,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-09 01:55:54,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:54,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-09 01:55:54,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2025-03-09 01:55:54,012 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-09 01:55:54,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:54,080 INFO L93 Difference]: Finished difference Result 123 states and 141 transitions. [2025-03-09 01:55:54,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-09 01:55:54,081 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-09 01:55:54,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:54,081 INFO L225 Difference]: With dead ends: 123 [2025-03-09 01:55:54,082 INFO L226 Difference]: Without dead ends: 122 [2025-03-09 01:55:54,082 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-09 01:55:54,082 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 01:55:54,083 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.1s Time] [2025-03-09 01:55:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-09 01:55:54,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 108. [2025-03-09 01:55:54,090 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-09 01:55:54,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2025-03-09 01:55:54,091 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 72 [2025-03-09 01:55:54,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:54,091 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2025-03-09 01:55:54,091 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-09 01:55:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2025-03-09 01:55:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-09 01:55:54,094 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:54,094 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-09 01:55:54,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 01:55:54,295 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-09 01:55:54,295 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-09 01:55:54,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1999018697, now seen corresponding path program 2 times [2025-03-09 01:55:54,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:54,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759094842] [2025-03-09 01:55:54,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:54,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:54,310 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-09 01:55:54,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 01:55:54,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:54,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:54,584 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-09 01:55:54,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759094842] [2025-03-09 01:55:54,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759094842] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:54,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889345322] [2025-03-09 01:55:54,585 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:54,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:54,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:54,587 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-09 01:55:54,589 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-09 01:55:54,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 78 statements into 2 equivalence classes. [2025-03-09 01:55:54,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 01:55:54,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:54,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:54,755 INFO L256 TraceCheckSpWp]: Trace formula consists of 503 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 01:55:54,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:54,819 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-09 01:55:54,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:55,106 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-09 01:55:55,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889345322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:55,106 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:55,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 35 [2025-03-09 01:55:55,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653539971] [2025-03-09 01:55:55,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:55,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 01:55:55,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:55,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 01:55:55,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=949, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 01:55:55,109 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-09 01:55:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:55,189 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-03-09 01:55:55,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-09 01:55:55,189 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-09 01:55:55,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:55,190 INFO L225 Difference]: With dead ends: 132 [2025-03-09 01:55:55,190 INFO L226 Difference]: Without dead ends: 111 [2025-03-09 01:55:55,191 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-09 01:55:55,191 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-09 01:55:55,192 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-09 01:55:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-09 01:55:55,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-09 01:55:55,196 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-09 01:55:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2025-03-09 01:55:55,196 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 78 [2025-03-09 01:55:55,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:55,196 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2025-03-09 01:55:55,196 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-09 01:55:55,197 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2025-03-09 01:55:55,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 01:55:55,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:55,197 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-09 01:55:55,206 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-09 01:55:55,397 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-09 01:55:55,398 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-09 01:55:55,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:55,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1127273230, now seen corresponding path program 2 times [2025-03-09 01:55:55,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:55,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430304006] [2025-03-09 01:55:55,398 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:55,417 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 01:55:55,436 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 01:55:55,436 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:55,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:56,029 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-09 01:55:56,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430304006] [2025-03-09 01:55:56,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430304006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:56,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220451660] [2025-03-09 01:55:56,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:55:56,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:56,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:56,032 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-09 01:55:56,034 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-09 01:55:56,155 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 01:55:56,227 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 01:55:56,227 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:55:56,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:56,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 01:55:56,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:56,338 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-09 01:55:56,338 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:57,091 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-09 01:55:57,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220451660] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:55:57,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:55:57,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 63 [2025-03-09 01:55:57,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554210192] [2025-03-09 01:55:57,092 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:57,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-03-09 01:55:57,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:57,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-03-09 01:55:57,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1055, Invalid=2977, Unknown=0, NotChecked=0, Total=4032 [2025-03-09 01:55:57,094 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-09 01:55:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:57,235 INFO L93 Difference]: Finished difference Result 219 states and 253 transitions. [2025-03-09 01:55:57,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-03-09 01:55:57,236 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-09 01:55:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:57,237 INFO L225 Difference]: With dead ends: 219 [2025-03-09 01:55:57,237 INFO L226 Difference]: Without dead ends: 218 [2025-03-09 01:55:57,238 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-09 01:55:57,238 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-09 01:55:57,238 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-09 01:55:57,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-09 01:55:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 188. [2025-03-09 01:55:57,245 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-09 01:55:57,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 207 transitions. [2025-03-09 01:55:57,247 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 207 transitions. Word has length 112 [2025-03-09 01:55:57,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:57,247 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 207 transitions. [2025-03-09 01:55:57,247 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-09 01:55:57,247 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 207 transitions. [2025-03-09 01:55:57,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-09 01:55:57,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:57,248 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-09 01:55:57,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-09 01:55:57,448 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-09 01:55:57,448 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-09 01:55:57,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:57,449 INFO L85 PathProgramCache]: Analyzing trace with hash -580430263, now seen corresponding path program 3 times [2025-03-09 01:55:57,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:57,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398586197] [2025-03-09 01:55:57,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:55:57,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:57,473 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 16 equivalence classes. [2025-03-09 01:55:57,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 53 of 118 statements. [2025-03-09 01:55:57,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:55:57,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:58,047 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-09 01:55:58,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:55:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398586197] [2025-03-09 01:55:58,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398586197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:58,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188898468] [2025-03-09 01:55:58,048 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:55:58,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:55:58,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:55:58,051 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-09 01:55:58,053 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-09 01:55:58,179 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 118 statements into 16 equivalence classes. [2025-03-09 01:55:58,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 53 of 118 statements. [2025-03-09 01:55:58,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-09 01:55:58,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:55:58,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-03-09 01:55:58,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:55:58,337 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-09 01:55:58,412 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-09 01:55:58,533 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-09 01:55:58,536 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-09 01:55:58,553 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-09 01:55:58,576 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:55:58,581 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-09 01:55:58,596 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-09 01:55:58,596 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-09 01:55:58,678 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-09 01:55:58,703 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-09 01:55:58,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:55:58,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188898468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:55:58,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 01:55:58,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 31 [2025-03-09 01:55:58,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391516482] [2025-03-09 01:55:58,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 01:55:58,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-09 01:55:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:55:58,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-09 01:55:58,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=903, Unknown=2, NotChecked=60, Total=1056 [2025-03-09 01:55:58,802 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-09 01:55:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:55:59,193 INFO L93 Difference]: Finished difference Result 355 states and 391 transitions. [2025-03-09 01:55:59,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-09 01:55:59,194 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-09 01:55:59,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:55:59,196 INFO L225 Difference]: With dead ends: 355 [2025-03-09 01:55:59,196 INFO L226 Difference]: Without dead ends: 191 [2025-03-09 01:55:59,197 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-09 01:55:59,197 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-09 01:55:59,197 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-09 01:55:59,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-03-09 01:55:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2025-03-09 01:55:59,204 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-09 01:55:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 209 transitions. [2025-03-09 01:55:59,205 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 209 transitions. Word has length 118 [2025-03-09 01:55:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:55:59,205 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 209 transitions. [2025-03-09 01:55:59,205 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-09 01:55:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 209 transitions. [2025-03-09 01:55:59,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-09 01:55:59,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:55:59,206 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-09 01:55:59,213 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-09 01:55:59,407 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-09 01:55:59,407 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-09 01:55:59,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:55:59,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1266577016, now seen corresponding path program 1 times [2025-03-09 01:55:59,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:55:59,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687764158] [2025-03-09 01:55:59,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:55:59,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:55:59,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-09 01:55:59,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-09 01:55:59,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:55:59,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:00,067 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-09 01:56:00,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687764158] [2025-03-09 01:56:00,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687764158] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:00,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884247621] [2025-03-09 01:56:00,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:00,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:00,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:00,070 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-09 01:56:00,071 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-09 01:56:00,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-09 01:56:00,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-09 01:56:00,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:00,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:00,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-09 01:56:00,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:00,366 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-09 01:56:00,366 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:01,153 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-09 01:56:01,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884247621] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:01,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:01,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 67 [2025-03-09 01:56:01,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916068925] [2025-03-09 01:56:01,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:01,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-03-09 01:56:01,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:01,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-03-09 01:56:01,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1127, Invalid=3429, Unknown=0, NotChecked=0, Total=4556 [2025-03-09 01:56:01,156 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-09 01:56:01,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:01,278 INFO L93 Difference]: Finished difference Result 230 states and 249 transitions. [2025-03-09 01:56:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-03-09 01:56:01,279 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-09 01:56:01,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:01,280 INFO L225 Difference]: With dead ends: 230 [2025-03-09 01:56:01,280 INFO L226 Difference]: Without dead ends: 193 [2025-03-09 01:56:01,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1127, Invalid=3429, Unknown=0, NotChecked=0, Total=4556 [2025-03-09 01:56:01,281 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-09 01:56:01,282 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-09 01:56:01,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-09 01:56:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2025-03-09 01:56:01,287 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-09 01:56:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 196 transitions. [2025-03-09 01:56:01,288 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 196 transitions. Word has length 120 [2025-03-09 01:56:01,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:01,288 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 196 transitions. [2025-03-09 01:56:01,289 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-09 01:56:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 196 transitions. [2025-03-09 01:56:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-09 01:56:01,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:01,290 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-09 01:56:01,297 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-09 01:56:01,490 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-09 01:56:01,490 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-09 01:56:01,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash -893121907, now seen corresponding path program 1 times [2025-03-09 01:56:01,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:01,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770109839] [2025-03-09 01:56:01,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:01,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:01,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-09 01:56:01,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-09 01:56:01,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:01,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:03,196 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-09 01:56:03,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:03,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770109839] [2025-03-09 01:56:03,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770109839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:03,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799885793] [2025-03-09 01:56:03,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 01:56:03,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:03,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:03,201 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-09 01:56:03,202 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-09 01:56:03,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-09 01:56:03,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-09 01:56:03,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 01:56:03,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:03,429 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 63 conjuncts are in the unsatisfiable core [2025-03-09 01:56:03,432 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:03,624 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-09 01:56:03,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:06,039 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-09 01:56:06,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799885793] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:06,040 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:06,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63, 63] total 127 [2025-03-09 01:56:06,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918142046] [2025-03-09 01:56:06,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:06,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 128 states [2025-03-09 01:56:06,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2025-03-09 01:56:06,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4159, Invalid=12097, Unknown=0, NotChecked=0, Total=16256 [2025-03-09 01:56:06,046 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-09 01:56:06,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:06,292 INFO L93 Difference]: Finished difference Result 413 states and 479 transitions. [2025-03-09 01:56:06,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2025-03-09 01:56:06,293 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-09 01:56:06,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:06,295 INFO L225 Difference]: With dead ends: 413 [2025-03-09 01:56:06,295 INFO L226 Difference]: Without dead ends: 412 [2025-03-09 01:56:06,298 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-09 01:56:06,299 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-09 01:56:06,299 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-09 01:56:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-03-09 01:56:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 350. [2025-03-09 01:56:06,312 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-09 01:56:06,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 385 transitions. [2025-03-09 01:56:06,315 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 385 transitions. Word has length 194 [2025-03-09 01:56:06,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:06,315 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 385 transitions. [2025-03-09 01:56:06,316 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-09 01:56:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 385 transitions. [2025-03-09 01:56:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-03-09 01:56:06,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:06,318 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-09 01:56:06,326 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-09 01:56:06,518 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-09 01:56:06,518 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-09 01:56:06,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:06,519 INFO L85 PathProgramCache]: Analyzing trace with hash -542330232, now seen corresponding path program 2 times [2025-03-09 01:56:06,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:06,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099409658] [2025-03-09 01:56:06,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:56:06,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:06,535 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-03-09 01:56:06,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-03-09 01:56:06,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:56:06,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:08,307 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-09 01:56:08,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099409658] [2025-03-09 01:56:08,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099409658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:08,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1292930719] [2025-03-09 01:56:08,307 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:56:08,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:08,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:08,309 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-09 01:56:08,309 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-09 01:56:08,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 200 statements into 2 equivalence classes. [2025-03-09 01:56:08,547 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 200 of 200 statements. [2025-03-09 01:56:08,548 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:56:08,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:08,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 1064 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-09 01:56:08,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:08,753 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-09 01:56:08,753 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:11,003 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-09 01:56:11,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1292930719] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:11,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:11,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65, 65] total 131 [2025-03-09 01:56:11,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668112419] [2025-03-09 01:56:11,003 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:11,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2025-03-09 01:56:11,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:11,005 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2025-03-09 01:56:11,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=4295, Invalid=12997, Unknown=0, NotChecked=0, Total=17292 [2025-03-09 01:56:11,009 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-09 01:56:11,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:11,291 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2025-03-09 01:56:11,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2025-03-09 01:56:11,292 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-09 01:56:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:11,293 INFO L225 Difference]: With dead ends: 422 [2025-03-09 01:56:11,293 INFO L226 Difference]: Without dead ends: 353 [2025-03-09 01:56:11,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 463 GetRequests, 333 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5395 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4295, Invalid=12997, Unknown=0, NotChecked=0, Total=17292 [2025-03-09 01:56:11,295 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-09 01:56:11,295 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-09 01:56:11,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2025-03-09 01:56:11,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 352. [2025-03-09 01:56:11,302 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-09 01:56:11,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 356 transitions. [2025-03-09 01:56:11,303 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 356 transitions. Word has length 200 [2025-03-09 01:56:11,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:11,304 INFO L471 AbstractCegarLoop]: Abstraction has 352 states and 356 transitions. [2025-03-09 01:56:11,304 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-09 01:56:11,304 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 356 transitions. [2025-03-09 01:56:11,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2025-03-09 01:56:11,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:11,306 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-09 01:56:11,315 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-09 01:56:11,507 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-09 01:56:11,507 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-09 01:56:11,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:11,508 INFO L85 PathProgramCache]: Analyzing trace with hash 657837197, now seen corresponding path program 2 times [2025-03-09 01:56:11,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:11,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517335449] [2025-03-09 01:56:11,508 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:56:11,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:11,530 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 354 statements into 2 equivalence classes. [2025-03-09 01:56:11,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 354 of 354 statements. [2025-03-09 01:56:11,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:56:11,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:17,374 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-09 01:56:17,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:17,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517335449] [2025-03-09 01:56:17,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517335449] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:17,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037486312] [2025-03-09 01:56:17,375 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 01:56:17,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:17,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:17,376 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-09 01:56:17,377 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-09 01:56:17,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 354 statements into 2 equivalence classes. [2025-03-09 01:56:17,680 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 354 of 354 statements. [2025-03-09 01:56:17,681 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 01:56:17,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:17,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 1782 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-09 01:56:17,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:18,003 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-09 01:56:18,003 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 01:56:26,380 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-09 01:56:26,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037486312] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 01:56:26,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 01:56:26,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [127, 127, 127] total 255 [2025-03-09 01:56:26,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848583188] [2025-03-09 01:56:26,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 01:56:26,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 256 states [2025-03-09 01:56:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 01:56:26,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 256 interpolants. [2025-03-09 01:56:26,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16511, Invalid=48769, Unknown=0, NotChecked=0, Total=65280 [2025-03-09 01:56:26,388 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-09 01:56:27,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 01:56:27,244 INFO L93 Difference]: Finished difference Result 797 states and 927 transitions. [2025-03-09 01:56:27,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2025-03-09 01:56:27,248 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-09 01:56:27,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 01:56:27,250 INFO L225 Difference]: With dead ends: 797 [2025-03-09 01:56:27,251 INFO L226 Difference]: Without dead ends: 796 [2025-03-09 01:56:27,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 833 GetRequests, 579 SyntacticMatches, 0 SemanticMatches, 254 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20343 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=16511, Invalid=48769, Unknown=0, NotChecked=0, Total=65280 [2025-03-09 01:56:27,259 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-09 01:56:27,260 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-09 01:56:27,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-03-09 01:56:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 670. [2025-03-09 01:56:27,275 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-09 01:56:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 737 transitions. [2025-03-09 01:56:27,278 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 737 transitions. Word has length 354 [2025-03-09 01:56:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 01:56:27,278 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 737 transitions. [2025-03-09 01:56:27,279 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-09 01:56:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 737 transitions. [2025-03-09 01:56:27,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-03-09 01:56:27,285 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 01:56:27,285 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-09 01:56:27,296 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-09 01:56:27,486 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-09 01:56:27,486 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-09 01:56:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 01:56:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -599460728, now seen corresponding path program 3 times [2025-03-09 01:56:27,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 01:56:27,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350994948] [2025-03-09 01:56:27,487 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:56:27,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 01:56:27,506 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 360 statements into 64 equivalence classes. [2025-03-09 01:56:27,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 105 of 360 statements. [2025-03-09 01:56:27,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-09 01:56:27,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:29,523 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-09 01:56:29,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 01:56:29,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350994948] [2025-03-09 01:56:29,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350994948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 01:56:29,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593199084] [2025-03-09 01:56:29,524 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 01:56:29,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 01:56:29,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 01:56:29,526 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-09 01:56:29,527 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-09 01:56:29,703 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 360 statements into 64 equivalence classes. [2025-03-09 01:56:30,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) and asserted 105 of 360 statements. [2025-03-09 01:56:30,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2025-03-09 01:56:30,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 01:56:30,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 135 conjuncts are in the unsatisfiable core [2025-03-09 01:56:30,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 01:56:30,379 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-09 01:56:30,430 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-09 01:56:30,571 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-09 01:56:30,573 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-09 01:56:30,684 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-09 01:56:30,687 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-09 01:56:30,778 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-09 01:56:30,778 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-09 01:56:30,794 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-09 01:56:31,495 INFO L349 Elim1Store]: treesize reduction 72, result has 30.1 percent of original size [2025-03-09 01:56:31,499 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-09 01:56:31,507 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-09 01:56:31,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 01:56:31,520 INFO L349 Elim1Store]: treesize reduction 69, result has 21.6 percent of original size [2025-03-09 01:56:31,520 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-09 01:56:31,628 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-09 01:56:32,113 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-03-09 01:56:32,113 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-09 01:56:33,017 INFO L349 Elim1Store]: treesize reduction 72, result has 83.7 percent of original size [2025-03-09 01:56:33,017 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-09 01:56:33,127 INFO L349 Elim1Store]: treesize reduction 56, result has 66.9 percent of original size [2025-03-09 01:56:33,128 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