./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:00:02,768 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:00:02,814 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:00:02,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:00:02,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:00:02,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:00:02,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:00:02,836 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:00:02,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:00:02,837 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:00:02,837 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:00:02,837 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:00:02,837 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:00:02,838 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:00:02,838 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:00:02,838 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:00:02,839 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:00:02,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:00:02,839 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:00:02,839 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:00:02,839 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2025-03-04 15:00:03,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:00:03,033 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:00:03,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:00:03,035 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:00:03,035 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:00:03,036 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2025-03-04 15:00:04,194 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc2fee48/12fac76b767441258bd2c26a636a1fa8/FLAG8a26d56ed [2025-03-04 15:00:04,545 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:00:04,546 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-1.i [2025-03-04 15:00:04,563 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc2fee48/12fac76b767441258bd2c26a636a1fa8/FLAG8a26d56ed [2025-03-04 15:00:04,576 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bdc2fee48/12fac76b767441258bd2c26a636a1fa8 [2025-03-04 15:00:04,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:00:04,580 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:00:04,581 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:00:04,581 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:00:04,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:00:04,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:00:04" (1/1) ... [2025-03-04 15:00:04,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e519300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:04, skipping insertion in model container [2025-03-04 15:00:04,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:00:04" (1/1) ... [2025-03-04 15:00:04,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:00:04,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:00:04,953 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:00:05,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:00:05,057 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:00:05,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05 WrapperNode [2025-03-04 15:00:05,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:00:05,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:00:05,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:00:05,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:00:05,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,125 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1247 [2025-03-04 15:00:05,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:00:05,128 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:00:05,128 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:00:05,128 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:00:05,136 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,137 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,184 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2025-03-04 15:00:05,184 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,184 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,230 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:00:05,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:00:05,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:00:05,231 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:00:05,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (1/1) ... [2025-03-04 15:00:05,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:00:05,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:05,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:00:05,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:00:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 15:00:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 15:00:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 15:00:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 15:00:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 15:00:05,278 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 15:00:05,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:00:05,279 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 15:00:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 15:00:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 15:00:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:00:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:00:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:00:05,280 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:00:05,280 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:00:05,441 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:00:05,442 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:00:06,480 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2025-03-04 15:00:06,559 INFO L? ?]: Removed 303 outVars from TransFormulas that were not future-live. [2025-03-04 15:00:06,560 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:00:06,605 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:00:06,609 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-04 15:00:06,609 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:00:06 BoogieIcfgContainer [2025-03-04 15:00:06,610 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:00:06,612 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:00:06,612 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:00:06,615 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:00:06,615 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:00:04" (1/3) ... [2025-03-04 15:00:06,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5a439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:00:06, skipping insertion in model container [2025-03-04 15:00:06,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:00:05" (2/3) ... [2025-03-04 15:00:06,616 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e5a439b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:00:06, skipping insertion in model container [2025-03-04 15:00:06,616 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:00:06" (3/3) ... [2025-03-04 15:00:06,618 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-1.i [2025-03-04 15:00:06,628 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:00:06,630 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test2-1.i that has 4 procedures, 380 locations, 1 initial locations, 31 loop locations, and 6 error locations. [2025-03-04 15:00:06,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:00:06,690 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;@214894ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:00:06,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-04 15:00:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 372 states, 361 states have (on average 1.6232686980609419) internal successors, (586), 367 states have internal predecessors, (586), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 15:00:06,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 15:00:06,699 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:06,699 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:06,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:06,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash -817968332, now seen corresponding path program 1 times [2025-03-04 15:00:06,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:06,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824701033] [2025-03-04 15:00:06,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:06,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:06,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:00:06,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:00:06,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:06,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:00:06,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:06,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824701033] [2025-03-04 15:00:06,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824701033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:06,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:06,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:00:06,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581059436] [2025-03-04 15:00:06,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:06,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 15:00:06,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:06,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:00:06,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:00:06,845 INFO L87 Difference]: Start difference. First operand has 372 states, 361 states have (on average 1.6232686980609419) internal successors, (586), 367 states have internal predecessors, (586), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:06,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:06,981 INFO L93 Difference]: Finished difference Result 740 states and 1179 transitions. [2025-03-04 15:00:06,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:00:06,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 15:00:06,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:06,988 INFO L225 Difference]: With dead ends: 740 [2025-03-04 15:00:06,989 INFO L226 Difference]: Without dead ends: 366 [2025-03-04 15:00:06,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:00:06,993 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:06,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 494 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:00:07,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2025-03-04 15:00:07,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2025-03-04 15:00:07,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 356 states have (on average 1.4691011235955056) internal successors, (523), 361 states have internal predecessors, (523), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 15:00:07,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 529 transitions. [2025-03-04 15:00:07,035 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 529 transitions. Word has length 8 [2025-03-04 15:00:07,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:07,036 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 529 transitions. [2025-03-04 15:00:07,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:07,036 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 529 transitions. [2025-03-04 15:00:07,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 15:00:07,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:07,037 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:07,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:00:07,037 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:07,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:07,037 INFO L85 PathProgramCache]: Analyzing trace with hash -817967371, now seen corresponding path program 1 times [2025-03-04 15:00:07,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:07,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115308799] [2025-03-04 15:00:07,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:07,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:07,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:00:07,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:00:07,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:07,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 15:00:07,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [94122015] [2025-03-04 15:00:07,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:07,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:07,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:07,085 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:07,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:00:07,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:00:07,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:00:07,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:07,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:07,187 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:00:07,190 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:07,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:00:07,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:00:07,236 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:00:07,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:07,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115308799] [2025-03-04 15:00:07,238 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-04 15:00:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94122015] [2025-03-04 15:00:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94122015] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:00:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376936057] [2025-03-04 15:00:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:00:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:07,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:00:07,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:00:07,240 INFO L87 Difference]: Start difference. First operand 366 states and 529 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:07,497 INFO L93 Difference]: Finished difference Result 725 states and 1051 transitions. [2025-03-04 15:00:07,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:00:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-04 15:00:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:07,501 INFO L225 Difference]: With dead ends: 725 [2025-03-04 15:00:07,502 INFO L226 Difference]: Without dead ends: 723 [2025-03-04 15:00:07,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:00:07,503 INFO L435 NwaCegarLoop]: 465 mSDtfsCounter, 509 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:07,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1389 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:00:07,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2025-03-04 15:00:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 372. [2025-03-04 15:00:07,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 362 states have (on average 1.4640883977900552) internal successors, (530), 367 states have internal predecessors, (530), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 15:00:07,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 536 transitions. [2025-03-04 15:00:07,530 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 536 transitions. Word has length 8 [2025-03-04 15:00:07,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:07,530 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 536 transitions. [2025-03-04 15:00:07,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:07,530 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 536 transitions. [2025-03-04 15:00:07,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 15:00:07,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:07,532 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:07,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 15:00:07,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:07,733 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:07,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:07,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1760185792, now seen corresponding path program 1 times [2025-03-04 15:00:07,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:07,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083517331] [2025-03-04 15:00:07,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:07,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:07,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 15:00:07,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:00:07,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:07,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:08,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:00:08,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:08,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083517331] [2025-03-04 15:00:08,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083517331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:08,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:08,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:00:08,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142681750] [2025-03-04 15:00:08,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:08,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:00:08,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:08,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:00:08,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:00:08,028 INFO L87 Difference]: Start difference. First operand 372 states and 536 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:08,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:08,144 INFO L93 Difference]: Finished difference Result 488 states and 703 transitions. [2025-03-04 15:00:08,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:00:08,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-04 15:00:08,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:08,146 INFO L225 Difference]: With dead ends: 488 [2025-03-04 15:00:08,146 INFO L226 Difference]: Without dead ends: 330 [2025-03-04 15:00:08,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:00:08,147 INFO L435 NwaCegarLoop]: 393 mSDtfsCounter, 36 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:08,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1165 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:00:08,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-04 15:00:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-04 15:00:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 320 states have (on average 1.415625) internal successors, (453), 325 states have internal predecessors, (453), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 15:00:08,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 459 transitions. [2025-03-04 15:00:08,158 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 459 transitions. Word has length 65 [2025-03-04 15:00:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:08,159 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 459 transitions. [2025-03-04 15:00:08,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 459 transitions. [2025-03-04 15:00:08,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 15:00:08,160 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:08,160 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:08,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:00:08,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:08,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:08,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1926067190, now seen corresponding path program 1 times [2025-03-04 15:00:08,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:08,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081498852] [2025-03-04 15:00:08,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:08,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:08,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 15:00:08,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:00:08,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:08,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:08,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:00:08,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:08,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081498852] [2025-03-04 15:00:08,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081498852] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:08,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:08,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:00:08,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335748825] [2025-03-04 15:00:08,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:08,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:00:08,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:08,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:00:08,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:00:08,284 INFO L87 Difference]: Start difference. First operand 330 states and 459 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:08,394 INFO L93 Difference]: Finished difference Result 440 states and 609 transitions. [2025-03-04 15:00:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:00:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-04 15:00:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:08,396 INFO L225 Difference]: With dead ends: 440 [2025-03-04 15:00:08,396 INFO L226 Difference]: Without dead ends: 324 [2025-03-04 15:00:08,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:00:08,396 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 9 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:08,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1166 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:00:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2025-03-04 15:00:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2025-03-04 15:00:08,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 314 states have (on average 1.410828025477707) internal successors, (443), 319 states have internal predecessors, (443), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 15:00:08,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 449 transitions. [2025-03-04 15:00:08,410 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 449 transitions. Word has length 65 [2025-03-04 15:00:08,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:08,410 INFO L471 AbstractCegarLoop]: Abstraction has 324 states and 449 transitions. [2025-03-04 15:00:08,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:08,411 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 449 transitions. [2025-03-04 15:00:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-04 15:00:08,415 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:08,415 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:08,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:00:08,415 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:08,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:08,415 INFO L85 PathProgramCache]: Analyzing trace with hash 150858234, now seen corresponding path program 1 times [2025-03-04 15:00:08,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:08,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982129116] [2025-03-04 15:00:08,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:08,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:08,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 15:00:08,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:00:08,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:08,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:00:08,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:08,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982129116] [2025-03-04 15:00:08,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982129116] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:08,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:08,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:00:08,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802628645] [2025-03-04 15:00:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:08,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:00:08,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:08,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:00:08,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:00:08,650 INFO L87 Difference]: Start difference. First operand 324 states and 449 transitions. Second operand has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:08,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:08,799 INFO L93 Difference]: Finished difference Result 627 states and 875 transitions. [2025-03-04 15:00:08,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:00:08,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2025-03-04 15:00:08,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:08,803 INFO L225 Difference]: With dead ends: 627 [2025-03-04 15:00:08,803 INFO L226 Difference]: Without dead ends: 625 [2025-03-04 15:00:08,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:00:08,804 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 366 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1259 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:08,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1259 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:00:08,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2025-03-04 15:00:08,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 432. [2025-03-04 15:00:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 422 states have (on average 1.3909952606635072) internal successors, (587), 427 states have internal predecessors, (587), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 15:00:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 593 transitions. [2025-03-04 15:00:08,825 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 593 transitions. Word has length 65 [2025-03-04 15:00:08,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:08,826 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 593 transitions. [2025-03-04 15:00:08,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.666666666666668) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:08,826 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 593 transitions. [2025-03-04 15:00:08,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 15:00:08,829 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:08,829 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:08,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:00:08,830 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:08,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:08,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1469598181, now seen corresponding path program 1 times [2025-03-04 15:00:08,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:08,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322919082] [2025-03-04 15:00:08,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:08,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:08,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 15:00:08,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:00:08,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:08,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:09,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:00:09,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:09,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322919082] [2025-03-04 15:00:09,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322919082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:09,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:09,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:00:09,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319960243] [2025-03-04 15:00:09,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:09,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:00:09,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:09,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:00:09,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:00:09,074 INFO L87 Difference]: Start difference. First operand 432 states and 593 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:09,175 INFO L93 Difference]: Finished difference Result 813 states and 1110 transitions. [2025-03-04 15:00:09,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:00:09,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 15:00:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:09,177 INFO L225 Difference]: With dead ends: 813 [2025-03-04 15:00:09,177 INFO L226 Difference]: Without dead ends: 390 [2025-03-04 15:00:09,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:00:09,178 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 30 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:09,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 935 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:00:09,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-03-04 15:00:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2025-03-04 15:00:09,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 380 states have (on average 1.3421052631578947) internal successors, (510), 385 states have internal predecessors, (510), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 15:00:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 516 transitions. [2025-03-04 15:00:09,191 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 516 transitions. Word has length 80 [2025-03-04 15:00:09,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:09,192 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 516 transitions. [2025-03-04 15:00:09,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:09,192 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 516 transitions. [2025-03-04 15:00:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 15:00:09,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:09,194 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:09,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:00:09,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:09,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:09,194 INFO L85 PathProgramCache]: Analyzing trace with hash 83654462, now seen corresponding path program 1 times [2025-03-04 15:00:09,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:09,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702868123] [2025-03-04 15:00:09,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:09,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:09,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 15:00:09,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:00:09,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:09,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:09,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:00:09,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:09,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702868123] [2025-03-04 15:00:09,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702868123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:09,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:09,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:00:09,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325406766] [2025-03-04 15:00:09,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:09,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:00:09,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:09,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:00:09,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:00:09,316 INFO L87 Difference]: Start difference. First operand 390 states and 516 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:09,412 INFO L93 Difference]: Finished difference Result 1031 states and 1370 transitions. [2025-03-04 15:00:09,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:00:09,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-04 15:00:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:09,415 INFO L225 Difference]: With dead ends: 1031 [2025-03-04 15:00:09,416 INFO L226 Difference]: Without dead ends: 650 [2025-03-04 15:00:09,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:00:09,417 INFO L435 NwaCegarLoop]: 334 mSDtfsCounter, 176 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:09,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 655 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:00:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2025-03-04 15:00:09,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 648. [2025-03-04 15:00:09,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 638 states have (on average 1.3401253918495297) internal successors, (855), 643 states have internal predecessors, (855), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 15:00:09,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 861 transitions. [2025-03-04 15:00:09,436 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 861 transitions. Word has length 80 [2025-03-04 15:00:09,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:09,436 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 861 transitions. [2025-03-04 15:00:09,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:00:09,436 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 861 transitions. [2025-03-04 15:00:09,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 15:00:09,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:09,438 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:09,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:00:09,439 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:09,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:09,439 INFO L85 PathProgramCache]: Analyzing trace with hash -1754061660, now seen corresponding path program 1 times [2025-03-04 15:00:09,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:09,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556190218] [2025-03-04 15:00:09,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:09,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:09,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 15:00:09,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 15:00:09,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:09,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:09,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:09,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556190218] [2025-03-04 15:00:09,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556190218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:09,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:09,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:00:09,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123591857] [2025-03-04 15:00:09,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:09,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:00:09,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:09,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:00:09,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:00:09,721 INFO L87 Difference]: Start difference. First operand 648 states and 861 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:09,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:09,835 INFO L93 Difference]: Finished difference Result 713 states and 946 transitions. [2025-03-04 15:00:09,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:00:09,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 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 95 [2025-03-04 15:00:09,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:09,838 INFO L225 Difference]: With dead ends: 713 [2025-03-04 15:00:09,838 INFO L226 Difference]: Without dead ends: 711 [2025-03-04 15:00:09,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:00:09,838 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 255 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:09,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1037 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 15:00:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2025-03-04 15:00:09,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 711. [2025-03-04 15:00:09,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 698 states have (on average 1.335243553008596) internal successors, (932), 703 states have internal predecessors, (932), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 15:00:09,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 944 transitions. [2025-03-04 15:00:09,854 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 944 transitions. Word has length 95 [2025-03-04 15:00:09,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:09,854 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 944 transitions. [2025-03-04 15:00:09,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 944 transitions. [2025-03-04 15:00:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 15:00:09,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:09,856 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:09,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:00:09,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:09,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:09,856 INFO L85 PathProgramCache]: Analyzing trace with hash 561348979, now seen corresponding path program 1 times [2025-03-04 15:00:09,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:09,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140749663] [2025-03-04 15:00:09,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:09,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:09,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 15:00:10,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 15:00:10,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:10,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:00:10,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:10,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140749663] [2025-03-04 15:00:10,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140749663] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:10,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449532828] [2025-03-04 15:00:10,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:10,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:10,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:10,168 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:10,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:00:10,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 15:00:10,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 15:00:10,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:10,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:10,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 15:00:10,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:10,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:00:10,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:00:10,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 15:00:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:11,067 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:00:11,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449532828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:11,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:00:11,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-04 15:00:11,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565573651] [2025-03-04 15:00:11,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:11,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:00:11,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:11,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:00:11,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:00:11,069 INFO L87 Difference]: Start difference. First operand 711 states and 944 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:12,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:12,337 INFO L93 Difference]: Finished difference Result 1311 states and 1742 transitions. [2025-03-04 15:00:12,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:00:12,337 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 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 101 [2025-03-04 15:00:12,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:12,339 INFO L225 Difference]: With dead ends: 1311 [2025-03-04 15:00:12,339 INFO L226 Difference]: Without dead ends: 725 [2025-03-04 15:00:12,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-04 15:00:12,340 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 464 mSDsluCounter, 1712 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 2074 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:12,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 2074 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 15:00:12,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2025-03-04 15:00:12,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 711. [2025-03-04 15:00:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 698 states have (on average 1.333810888252149) internal successors, (931), 703 states have internal predecessors, (931), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 15:00:12,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 943 transitions. [2025-03-04 15:00:12,355 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 943 transitions. Word has length 101 [2025-03-04 15:00:12,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:12,355 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 943 transitions. [2025-03-04 15:00:12,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:12,355 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 943 transitions. [2025-03-04 15:00:12,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-04 15:00:12,356 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:12,356 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:12,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:00:12,557 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,SelfDestructingSolverStorable8 [2025-03-04 15:00:12,557 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:12,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:12,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1405526831, now seen corresponding path program 1 times [2025-03-04 15:00:12,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:12,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862433238] [2025-03-04 15:00:12,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:12,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:12,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 15:00:12,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 15:00:12,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:12,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:12,894 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:00:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862433238] [2025-03-04 15:00:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862433238] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1092787587] [2025-03-04 15:00:12,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:12,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:12,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:12,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:12,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:00:13,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-04 15:00:13,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-04 15:00:13,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:13,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:13,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 15:00:13,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:13,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:00:13,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:00:13,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-04 15:00:13,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:13,889 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:00:13,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1092787587] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:13,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:00:13,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-04 15:00:13,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478443396] [2025-03-04 15:00:13,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:13,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:00:13,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:13,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:00:13,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 15:00:13,890 INFO L87 Difference]: Start difference. First operand 711 states and 943 transitions. Second operand has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:14,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:14,778 INFO L93 Difference]: Finished difference Result 1326 states and 1762 transitions. [2025-03-04 15:00:14,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:00:14,779 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 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 102 [2025-03-04 15:00:14,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:14,781 INFO L225 Difference]: With dead ends: 1326 [2025-03-04 15:00:14,781 INFO L226 Difference]: Without dead ends: 745 [2025-03-04 15:00:14,783 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-04 15:00:14,783 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 543 mSDsluCounter, 1023 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:14,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 1342 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 15:00:14,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2025-03-04 15:00:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 727. [2025-03-04 15:00:14,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 714 states have (on average 1.3319327731092436) internal successors, (951), 719 states have internal predecessors, (951), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 15:00:14,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 963 transitions. [2025-03-04 15:00:14,798 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 963 transitions. Word has length 102 [2025-03-04 15:00:14,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:14,798 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 963 transitions. [2025-03-04 15:00:14,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:14,799 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 963 transitions. [2025-03-04 15:00:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 15:00:14,799 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:14,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:14,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:00:15,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:15,000 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:15,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:15,001 INFO L85 PathProgramCache]: Analyzing trace with hash 507922832, now seen corresponding path program 1 times [2025-03-04 15:00:15,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:15,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603329499] [2025-03-04 15:00:15,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:15,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:15,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 15:00:15,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 15:00:15,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:15,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:15,250 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:15,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:15,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603329499] [2025-03-04 15:00:15,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603329499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:15,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:15,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:00:15,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517200998] [2025-03-04 15:00:15,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:15,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:00:15,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:15,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:00:15,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:00:15,251 INFO L87 Difference]: Start difference. First operand 727 states and 963 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:15,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:15,507 INFO L93 Difference]: Finished difference Result 1328 states and 1767 transitions. [2025-03-04 15:00:15,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:00:15,507 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 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 103 [2025-03-04 15:00:15,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:15,510 INFO L225 Difference]: With dead ends: 1328 [2025-03-04 15:00:15,510 INFO L226 Difference]: Without dead ends: 733 [2025-03-04 15:00:15,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:00:15,511 INFO L435 NwaCegarLoop]: 328 mSDtfsCounter, 9 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:15,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1372 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:00:15,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2025-03-04 15:00:15,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 733. [2025-03-04 15:00:15,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 720 states have (on average 1.3291666666666666) internal successors, (957), 725 states have internal predecessors, (957), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 15:00:15,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 969 transitions. [2025-03-04 15:00:15,526 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 969 transitions. Word has length 103 [2025-03-04 15:00:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:15,526 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 969 transitions. [2025-03-04 15:00:15,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 969 transitions. [2025-03-04 15:00:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 15:00:15,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:15,528 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:15,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:00:15,528 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:15,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:15,528 INFO L85 PathProgramCache]: Analyzing trace with hash -980299188, now seen corresponding path program 1 times [2025-03-04 15:00:15,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:15,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8883166] [2025-03-04 15:00:15,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:15,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:15,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-04 15:00:15,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-04 15:00:15,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:15,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:15,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:15,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8883166] [2025-03-04 15:00:15,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8883166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:15,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:15,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:00:15,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621290772] [2025-03-04 15:00:15,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:15,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:00:15,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:15,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:00:15,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:00:15,738 INFO L87 Difference]: Start difference. First operand 733 states and 969 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:16,028 INFO L93 Difference]: Finished difference Result 1334 states and 1771 transitions. [2025-03-04 15:00:16,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:00:16,029 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 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 103 [2025-03-04 15:00:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:16,031 INFO L225 Difference]: With dead ends: 1334 [2025-03-04 15:00:16,032 INFO L226 Difference]: Without dead ends: 743 [2025-03-04 15:00:16,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:00:16,033 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 14 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:16,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1622 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 15:00:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-04 15:00:16,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 741. [2025-03-04 15:00:16,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 728 states have (on average 1.3282967032967032) internal successors, (967), 733 states have internal predecessors, (967), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 15:00:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 979 transitions. [2025-03-04 15:00:16,053 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 979 transitions. Word has length 103 [2025-03-04 15:00:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:16,053 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 979 transitions. [2025-03-04 15:00:16,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 979 transitions. [2025-03-04 15:00:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-04 15:00:16,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:16,054 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:16,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:00:16,055 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:16,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1563674712, now seen corresponding path program 1 times [2025-03-04 15:00:16,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:16,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017785272] [2025-03-04 15:00:16,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:16,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:16,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 15:00:16,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 15:00:16,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:16,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:00:16,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:16,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017785272] [2025-03-04 15:00:16,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017785272] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:16,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664349828] [2025-03-04 15:00:16,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:16,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:16,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:16,262 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:16,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:00:16,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 15:00:16,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 15:00:16,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:16,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:16,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 15:00:16,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:16,713 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:16,713 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:00:16,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1664349828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:16,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:00:16,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 15:00:16,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207444308] [2025-03-04 15:00:16,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:16,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:00:16,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:16,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:00:16,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:00:16,714 INFO L87 Difference]: Start difference. First operand 741 states and 979 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:17,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:17,547 INFO L93 Difference]: Finished difference Result 1352 states and 1795 transitions. [2025-03-04 15:00:17,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:00:17,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 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 104 [2025-03-04 15:00:17,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:17,551 INFO L225 Difference]: With dead ends: 1352 [2025-03-04 15:00:17,551 INFO L226 Difference]: Without dead ends: 743 [2025-03-04 15:00:17,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:00:17,552 INFO L435 NwaCegarLoop]: 322 mSDtfsCounter, 12 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:17,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1603 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 15:00:17,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-03-04 15:00:17,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 731. [2025-03-04 15:00:17,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 731 states, 718 states have (on average 1.3245125348189415) internal successors, (951), 723 states have internal predecessors, (951), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 15:00:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 963 transitions. [2025-03-04 15:00:17,571 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 963 transitions. Word has length 104 [2025-03-04 15:00:17,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:17,572 INFO L471 AbstractCegarLoop]: Abstraction has 731 states and 963 transitions. [2025-03-04 15:00:17,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 963 transitions. [2025-03-04 15:00:17,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 15:00:17,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:17,574 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:17,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:00:17,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:17,774 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:17,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:17,775 INFO L85 PathProgramCache]: Analyzing trace with hash 973911177, now seen corresponding path program 1 times [2025-03-04 15:00:17,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:17,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23523519] [2025-03-04 15:00:17,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:17,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:17,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 15:00:17,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 15:00:17,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:17,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:18,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:18,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:18,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23523519] [2025-03-04 15:00:18,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23523519] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:18,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:18,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 15:00:18,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079055913] [2025-03-04 15:00:18,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:18,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:00:18,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:18,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:00:18,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:00:18,029 INFO L87 Difference]: Start difference. First operand 731 states and 963 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:18,334 INFO L93 Difference]: Finished difference Result 1332 states and 1761 transitions. [2025-03-04 15:00:18,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:00:18,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 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 105 [2025-03-04 15:00:18,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:18,338 INFO L225 Difference]: With dead ends: 1332 [2025-03-04 15:00:18,338 INFO L226 Difference]: Without dead ends: 751 [2025-03-04 15:00:18,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:00:18,339 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 20 mSDsluCounter, 1650 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:18,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1968 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 15:00:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2025-03-04 15:00:18,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 745. [2025-03-04 15:00:18,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 745 states, 732 states have (on average 1.3237704918032787) internal successors, (969), 737 states have internal predecessors, (969), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 15:00:18,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 981 transitions. [2025-03-04 15:00:18,360 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 981 transitions. Word has length 105 [2025-03-04 15:00:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:18,360 INFO L471 AbstractCegarLoop]: Abstraction has 745 states and 981 transitions. [2025-03-04 15:00:18,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:18,361 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 981 transitions. [2025-03-04 15:00:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 15:00:18,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:18,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:18,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:00:18,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:18,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:18,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1511836252, now seen corresponding path program 1 times [2025-03-04 15:00:18,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:18,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58277120] [2025-03-04 15:00:18,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:18,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:18,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 15:00:18,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 15:00:18,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:18,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:18,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:18,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58277120] [2025-03-04 15:00:18,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58277120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:18,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:00:18,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 15:00:18,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399199032] [2025-03-04 15:00:18,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:18,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:00:18,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:18,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:00:18,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:00:18,686 INFO L87 Difference]: Start difference. First operand 745 states and 981 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:19,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:19,095 INFO L93 Difference]: Finished difference Result 1356 states and 1794 transitions. [2025-03-04 15:00:19,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:00:19,096 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 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 106 [2025-03-04 15:00:19,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:19,098 INFO L225 Difference]: With dead ends: 1356 [2025-03-04 15:00:19,098 INFO L226 Difference]: Without dead ends: 763 [2025-03-04 15:00:19,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:00:19,101 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 23 mSDsluCounter, 1904 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2228 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:19,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2228 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 15:00:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 763 states. [2025-03-04 15:00:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 763 to 751. [2025-03-04 15:00:19,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 738 states have (on average 1.3211382113821137) internal successors, (975), 743 states have internal predecessors, (975), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 15:00:19,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 987 transitions. [2025-03-04 15:00:19,116 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 987 transitions. Word has length 106 [2025-03-04 15:00:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:19,116 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 987 transitions. [2025-03-04 15:00:19,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:19,116 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 987 transitions. [2025-03-04 15:00:19,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 15:00:19,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:19,117 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:19,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:00:19,117 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:19,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:19,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1261470559, now seen corresponding path program 1 times [2025-03-04 15:00:19,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:19,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813538969] [2025-03-04 15:00:19,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:19,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:19,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 15:00:19,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 15:00:19,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:19,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:19,363 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:00:19,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813538969] [2025-03-04 15:00:19,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813538969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:19,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814614935] [2025-03-04 15:00:19,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:19,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:19,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:19,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:19,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:00:19,555 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 15:00:19,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 15:00:19,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:19,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:19,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-04 15:00:19,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:19,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:19,720 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:00:19,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [814614935] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:19,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:00:19,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-04 15:00:19,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479167517] [2025-03-04 15:00:19,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:19,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:00:19,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:19,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:00:19,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:00:19,722 INFO L87 Difference]: Start difference. First operand 751 states and 987 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:19,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:19,976 INFO L93 Difference]: Finished difference Result 1356 states and 1789 transitions. [2025-03-04 15:00:19,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:00:19,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 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 106 [2025-03-04 15:00:19,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:19,979 INFO L225 Difference]: With dead ends: 1356 [2025-03-04 15:00:19,979 INFO L226 Difference]: Without dead ends: 765 [2025-03-04 15:00:19,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:00:19,981 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 39 mSDsluCounter, 1321 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 1634 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:19,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 1634 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 15:00:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2025-03-04 15:00:19,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 755. [2025-03-04 15:00:20,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 742 states have (on average 1.3194070080862534) internal successors, (979), 747 states have internal predecessors, (979), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-04 15:00:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 991 transitions. [2025-03-04 15:00:20,013 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 991 transitions. Word has length 106 [2025-03-04 15:00:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:20,013 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 991 transitions. [2025-03-04 15:00:20,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 7 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 991 transitions. [2025-03-04 15:00:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-04 15:00:20,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:20,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:20,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:00:20,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 15:00:20,220 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:20,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:20,222 INFO L85 PathProgramCache]: Analyzing trace with hash 335607013, now seen corresponding path program 1 times [2025-03-04 15:00:20,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:20,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350953251] [2025-03-04 15:00:20,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:20,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:20,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 15:00:20,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 15:00:20,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:20,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:00:20,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:20,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350953251] [2025-03-04 15:00:20,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350953251] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:20,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [116752726] [2025-03-04 15:00:20,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:20,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:20,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:20,449 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:20,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:00:20,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-04 15:00:20,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-04 15:00:20,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:20,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:20,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 15:00:20,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:00:20,799 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:00:20,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [116752726] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:20,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:00:20,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2025-03-04 15:00:20,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775939491] [2025-03-04 15:00:20,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:20,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:00:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:20,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:00:20,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:00:20,801 INFO L87 Difference]: Start difference. First operand 755 states and 991 transitions. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 15:00:20,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:20,861 INFO L93 Difference]: Finished difference Result 1316 states and 1733 transitions. [2025-03-04 15:00:20,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:00:20,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2025-03-04 15:00:20,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:20,866 INFO L225 Difference]: With dead ends: 1316 [2025-03-04 15:00:20,866 INFO L226 Difference]: Without dead ends: 758 [2025-03-04 15:00:20,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:00:20,868 INFO L435 NwaCegarLoop]: 332 mSDtfsCounter, 0 mSDsluCounter, 660 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:20,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 992 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 15:00:20,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2025-03-04 15:00:20,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 758. [2025-03-04 15:00:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 744 states have (on average 1.3198924731182795) internal successors, (982), 750 states have internal predecessors, (982), 6 states have call successors, (6), 1 states have call predecessors, (6), 2 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 15:00:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 996 transitions. [2025-03-04 15:00:20,885 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 996 transitions. Word has length 106 [2025-03-04 15:00:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:20,885 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 996 transitions. [2025-03-04 15:00:20,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 15:00:20,886 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 996 transitions. [2025-03-04 15:00:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 15:00:20,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:20,887 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:20,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:00:21,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 15:00:21,087 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:21,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash 79789225, now seen corresponding path program 1 times [2025-03-04 15:00:21,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:21,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974812871] [2025-03-04 15:00:21,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:21,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:21,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 15:00:21,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 15:00:21,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:21,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:00:21,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974812871] [2025-03-04 15:00:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974812871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:21,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134882153] [2025-03-04 15:00:21,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:21,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:21,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:21,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:21,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:00:21,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 15:00:21,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 15:00:21,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:21,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:21,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 15:00:21,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:21,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 15:00:22,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:00:22,010 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:00:22,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 15:00:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134882153] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:00:22,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:00:22,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 17 [2025-03-04 15:00:22,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065865129] [2025-03-04 15:00:22,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:00:22,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 15:00:22,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:22,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 15:00:22,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-04 15:00:22,259 INFO L87 Difference]: Start difference. First operand 758 states and 996 transitions. Second operand has 17 states, 17 states have (on average 12.176470588235293) internal successors, (207), 16 states have internal predecessors, (207), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 15:00:26,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:00:30,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:00:34,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:00:38,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:00:42,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-04 15:00:43,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:43,047 INFO L93 Difference]: Finished difference Result 1420 states and 1869 transitions. [2025-03-04 15:00:43,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 15:00:43,048 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.176470588235293) internal successors, (207), 16 states have internal predecessors, (207), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 108 [2025-03-04 15:00:43,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:43,051 INFO L225 Difference]: With dead ends: 1420 [2025-03-04 15:00:43,051 INFO L226 Difference]: Without dead ends: 857 [2025-03-04 15:00:43,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2025-03-04 15:00:43,052 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 857 mSDsluCounter, 2726 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 43 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 3112 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:43,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 3112 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 583 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2025-03-04 15:00:43,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 857 states. [2025-03-04 15:00:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 857 to 846. [2025-03-04 15:00:43,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 825 states have (on average 1.324848484848485) internal successors, (1093), 832 states have internal predecessors, (1093), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 15:00:43,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1113 transitions. [2025-03-04 15:00:43,075 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1113 transitions. Word has length 108 [2025-03-04 15:00:43,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:43,075 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1113 transitions. [2025-03-04 15:00:43,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.176470588235293) internal successors, (207), 16 states have internal predecessors, (207), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 15:00:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1113 transitions. [2025-03-04 15:00:43,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 15:00:43,076 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:43,076 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:43,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:00:43,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:43,279 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:43,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:43,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1909594331, now seen corresponding path program 2 times [2025-03-04 15:00:43,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:43,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327084691] [2025-03-04 15:00:43,279 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:00:43,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:43,309 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-04 15:00:43,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 15:00:43,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:00:43,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327084691] [2025-03-04 15:00:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327084691] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [442843773] [2025-03-04 15:00:43,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:00:43,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:43,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:43,569 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:43,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:00:43,792 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-04 15:00:43,800 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 112 statements. [2025-03-04 15:00:43,800 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:00:43,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:43,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:00:43,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:43,808 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 15 treesize of output 7 [2025-03-04 15:00:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-04 15:00:43,816 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:00:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [442843773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:00:43,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:00:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 9 [2025-03-04 15:00:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047684825] [2025-03-04 15:00:43,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:00:43,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:00:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:43,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:00:43,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:00:43,818 INFO L87 Difference]: Start difference. First operand 846 states and 1113 transitions. Second operand has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:43,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:43,862 INFO L93 Difference]: Finished difference Result 846 states and 1113 transitions. [2025-03-04 15:00:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:00:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 112 [2025-03-04 15:00:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:43,865 INFO L225 Difference]: With dead ends: 846 [2025-03-04 15:00:43,865 INFO L226 Difference]: Without dead ends: 845 [2025-03-04 15:00:43,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:00:43,865 INFO L435 NwaCegarLoop]: 331 mSDtfsCounter, 1 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:43,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 660 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 15:00:43,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2025-03-04 15:00:43,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 845. [2025-03-04 15:00:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 845 states, 825 states have (on average 1.3236363636363637) internal successors, (1092), 831 states have internal predecessors, (1092), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (12), 9 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 15:00:43,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1112 transitions. [2025-03-04 15:00:43,882 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1112 transitions. Word has length 112 [2025-03-04 15:00:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:43,882 INFO L471 AbstractCegarLoop]: Abstraction has 845 states and 1112 transitions. [2025-03-04 15:00:43,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 15:00:43,883 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1112 transitions. [2025-03-04 15:00:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-04 15:00:43,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:43,884 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:43,890 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:00:44,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:44,085 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:44,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:44,085 INFO L85 PathProgramCache]: Analyzing trace with hash 932118479, now seen corresponding path program 1 times [2025-03-04 15:00:44,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:44,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143470205] [2025-03-04 15:00:44,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:44,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:44,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 15:00:44,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 15:00:44,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:44,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:44,359 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:44,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143470205] [2025-03-04 15:00:44,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143470205] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343135524] [2025-03-04 15:00:44,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:00:44,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:44,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:44,361 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:44,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:00:44,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-04 15:00:44,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-04 15:00:44,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:00:44,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:44,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 15:00:44,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 15:00:44,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:00:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:44,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343135524] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:00:44,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:00:44,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2025-03-04 15:00:44,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092805279] [2025-03-04 15:00:44,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:00:44,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 15:00:44,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:00:44,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 15:00:44,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:00:44,898 INFO L87 Difference]: Start difference. First operand 845 states and 1112 transitions. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:00:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:00:45,408 INFO L93 Difference]: Finished difference Result 1456 states and 1925 transitions. [2025-03-04 15:00:45,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 15:00:45,408 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 113 [2025-03-04 15:00:45,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 15:00:45,411 INFO L225 Difference]: With dead ends: 1456 [2025-03-04 15:00:45,411 INFO L226 Difference]: Without dead ends: 800 [2025-03-04 15:00:45,411 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=489, Unknown=0, NotChecked=0, Total=756 [2025-03-04 15:00:45,412 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 30 mSDsluCounter, 2844 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3165 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 15:00:45,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3165 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 15:00:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-03-04 15:00:45,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 800. [2025-03-04 15:00:45,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 783 states have (on average 1.3167305236270754) internal successors, (1031), 789 states have internal predecessors, (1031), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 15:00:45,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1045 transitions. [2025-03-04 15:00:45,427 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1045 transitions. Word has length 113 [2025-03-04 15:00:45,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 15:00:45,427 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1045 transitions. [2025-03-04 15:00:45,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 15:00:45,427 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1045 transitions. [2025-03-04 15:00:45,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 15:00:45,428 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 15:00:45,428 INFO L218 NwaCegarLoop]: trace histogram [12, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:00:45,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:00:45,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:45,629 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-04 15:00:45,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:00:45,629 INFO L85 PathProgramCache]: Analyzing trace with hash -742250993, now seen corresponding path program 2 times [2025-03-04 15:00:45,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:00:45,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867832093] [2025-03-04 15:00:45,629 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:00:45,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:00:45,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-04 15:00:45,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 15:00:45,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:00:45,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:46,273 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 6 proven. 90 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 15:00:46,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:00:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867832093] [2025-03-04 15:00:46,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867832093] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:00:46,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039989319] [2025-03-04 15:00:46,273 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:00:46,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:00:46,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:00:46,275 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:00:46,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:00:46,519 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-04 15:00:47,173 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 15:00:47,173 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:00:47,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:00:47,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 793 conjuncts, 115 conjuncts are in the unsatisfiable core [2025-03-04 15:00:47,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:00:47,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 15:00:47,247 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 19 treesize of output 1 [2025-03-04 15:00:47,263 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-03-04 15:00:47,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-03-04 15:00:47,317 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 22 treesize of output 10 [2025-03-04 15:00:47,514 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-04 15:00:47,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-04 15:00:50,518 INFO L224 Elim1Store]: Index analysis took 116 ms