./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.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 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 19:16:20,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 19:16:20,454 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-17 19:16:20,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 19:16:20,463 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 19:16:20,482 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 19:16:20,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 19:16:20,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 19:16:20,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 19:16:20,483 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 19:16:20,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 19:16:20,483 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 19:16:20,483 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 19:16:20,484 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 19:16:20,484 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 19:16:20,484 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-17 19:16:20,485 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 19:16:20,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 19:16:20,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 19:16:20,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 19:16:20,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 19:16:20,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 19:16:20,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 19:16:20,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 19:16:20,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 19:16:20,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:16:20,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 19:16:20,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 19:16:20,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 19:16:20,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 19:16:20,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 19:16:20,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 19:16:20,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 19:16:20,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 19:16:20,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 19:16:20,487 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 19:16:20,488 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 -> 0fdcb64865aeb8184805095bc8dbe7392078d445cf902388dac9d1ca4533bb8c [2025-03-17 19:16:20,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 19:16:20,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 19:16:20,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 19:16:20,739 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 19:16:20,740 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 19:16:20,742 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-2.i [2025-03-17 19:16:21,878 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc4abfbc/617476025d374f06948a6a8f1e964ff3/FLAG745d462ea [2025-03-17 19:16:22,220 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 19:16:22,221 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_nondet_test2-2.i [2025-03-17 19:16:22,234 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc4abfbc/617476025d374f06948a6a8f1e964ff3/FLAG745d462ea [2025-03-17 19:16:22,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc4abfbc/617476025d374f06948a6a8f1e964ff3 [2025-03-17 19:16:22,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 19:16:22,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 19:16:22,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 19:16:22,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 19:16:22,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 19:16:22,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:16:22" (1/1) ... [2025-03-17 19:16:22,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425d401b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:22, skipping insertion in model container [2025-03-17 19:16:22,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 07:16:22" (1/1) ... [2025-03-17 19:16:22,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 19:16:22,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:16:22,953 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 19:16:23,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 19:16:23,056 INFO L204 MainTranslator]: Completed translation [2025-03-17 19:16:23,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23 WrapperNode [2025-03-17 19:16:23,057 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 19:16:23,058 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 19:16:23,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 19:16:23,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 19:16:23,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,080 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,121 INFO L138 Inliner]: procedures = 207, calls = 273, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1406 [2025-03-17 19:16:23,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 19:16:23,125 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 19:16:23,125 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 19:16:23,125 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 19:16:23,135 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,135 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,202 INFO L175 MemorySlicer]: Split 254 memory accesses to 3 slices as follows [2, 218, 34]. 86 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 54 writes are split as follows [0, 50, 4]. [2025-03-17 19:16:23,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,203 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,241 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,244 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,247 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,250 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 19:16:23,260 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 19:16:23,260 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 19:16:23,262 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 19:16:23,263 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (1/1) ... [2025-03-17 19:16:23,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 19:16:23,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:23,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 19:16:23,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 19:16:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-17 19:16:23,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-17 19:16:23,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-17 19:16:23,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-17 19:16:23,323 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 19:16:23,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 19:16:23,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 19:16:23,482 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 19:16:23,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 19:16:24,545 INFO L1322 $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-17 19:16:24,615 INFO L? ?]: Removed 329 outVars from TransFormulas that were not future-live. [2025-03-17 19:16:24,617 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 19:16:24,663 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 19:16:24,663 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-17 19:16:24,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:16:24 BoogieIcfgContainer [2025-03-17 19:16:24,664 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 19:16:24,665 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 19:16:24,665 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 19:16:24,668 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 19:16:24,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 07:16:22" (1/3) ... [2025-03-17 19:16:24,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6d9094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:16:24, skipping insertion in model container [2025-03-17 19:16:24,669 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 07:16:23" (2/3) ... [2025-03-17 19:16:24,669 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6d9094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 07:16:24, skipping insertion in model container [2025-03-17 19:16:24,670 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 07:16:24" (3/3) ... [2025-03-17 19:16:24,674 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SAX_nondet_test2-2.i [2025-03-17 19:16:24,685 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 19:16:24,686 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SAX_nondet_test2-2.i that has 4 procedures, 412 locations, 1 initial locations, 36 loop locations, and 6 error locations. [2025-03-17 19:16:24,739 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 19:16:24,746 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;@388b8098, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 19:16:24,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-17 19:16:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 393 states have (on average 1.6259541984732824) internal successors, (639), 399 states have internal predecessors, (639), 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-17 19:16:24,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 19:16:24,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:24,753 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:16:24,753 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-17 19:16:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:24,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1493720370, now seen corresponding path program 1 times [2025-03-17 19:16:24,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:24,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678876615] [2025-03-17 19:16:24,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:24,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:16:24,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:16:24,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:24,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:24,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:16:24,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:24,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678876615] [2025-03-17 19:16:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678876615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:24,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:24,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:16:24,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130662278] [2025-03-17 19:16:24,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:24,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 19:16:24,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:24,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 19:16:24,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 19:16:24,929 INFO L87 Difference]: Start difference. First operand has 404 states, 393 states have (on average 1.6259541984732824) internal successors, (639), 399 states have internal predecessors, (639), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:25,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:25,057 INFO L93 Difference]: Finished difference Result 805 states and 1286 transitions. [2025-03-17 19:16:25,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 19:16:25,059 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 19:16:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:25,065 INFO L225 Difference]: With dead ends: 805 [2025-03-17 19:16:25,067 INFO L226 Difference]: Without dead ends: 365 [2025-03-17 19:16:25,070 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-17 19:16:25,071 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:25,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:16:25,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-17 19:16:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2025-03-17 19:16:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 355 states have (on average 1.4704225352112676) internal successors, (522), 360 states have internal predecessors, (522), 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-17 19:16:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 528 transitions. [2025-03-17 19:16:25,121 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 528 transitions. Word has length 7 [2025-03-17 19:16:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:25,122 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 528 transitions. [2025-03-17 19:16:25,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:25,123 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 528 transitions. [2025-03-17 19:16:25,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-17 19:16:25,123 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:25,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:16:25,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 19:16:25,123 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-17 19:16:25,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1493719409, now seen corresponding path program 1 times [2025-03-17 19:16:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:25,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948297882] [2025-03-17 19:16:25,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:25,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:16:25,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:16:25,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:25,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 19:16:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2005422344] [2025-03-17 19:16:25,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:25,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:25,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:25,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:16:25,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 19:16:25,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-17 19:16:25,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-17 19:16:25,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:25,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:25,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 19:16:25,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:16:25,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:16:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:16:25,344 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:16:25,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:25,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948297882] [2025-03-17 19:16:25,345 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 19:16:25,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2005422344] [2025-03-17 19:16:25,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2005422344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:25,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:25,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:16:25,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278821906] [2025-03-17 19:16:25,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:25,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:16:25,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:25,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:16:25,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:16:25,348 INFO L87 Difference]: Start difference. First operand 365 states and 528 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:25,568 INFO L93 Difference]: Finished difference Result 724 states and 1050 transitions. [2025-03-17 19:16:25,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:16:25,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-17 19:16:25,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:25,572 INFO L225 Difference]: With dead ends: 724 [2025-03-17 19:16:25,572 INFO L226 Difference]: Without dead ends: 722 [2025-03-17 19:16:25,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:16:25,573 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 509 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 1464 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:25,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 1464 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:16:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2025-03-17 19:16:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 371. [2025-03-17 19:16:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 361 states have (on average 1.4653739612188366) internal successors, (529), 366 states have internal predecessors, (529), 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-17 19:16:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 535 transitions. [2025-03-17 19:16:25,602 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 535 transitions. Word has length 7 [2025-03-17 19:16:25,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:25,602 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 535 transitions. [2025-03-17 19:16:25,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 535 transitions. [2025-03-17 19:16:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 19:16:25,604 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:25,604 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 19:16:25,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 19:16:25,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:25,810 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-17 19:16:25,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:25,811 INFO L85 PathProgramCache]: Analyzing trace with hash 77519837, now seen corresponding path program 1 times [2025-03-17 19:16:25,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:25,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751783125] [2025-03-17 19:16:25,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:25,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:25,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 19:16:25,866 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 19:16:25,866 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:25,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:16:26,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:26,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751783125] [2025-03-17 19:16:26,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751783125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:26,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:26,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:16:26,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614202615] [2025-03-17 19:16:26,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:26,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:16:26,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:26,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:16:26,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:16:26,132 INFO L87 Difference]: Start difference. First operand 371 states and 535 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:26,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:26,267 INFO L93 Difference]: Finished difference Result 487 states and 702 transitions. [2025-03-17 19:16:26,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 19:16:26,267 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-03-17 19:16:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:26,269 INFO L225 Difference]: With dead ends: 487 [2025-03-17 19:16:26,269 INFO L226 Difference]: Without dead ends: 329 [2025-03-17 19:16:26,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:16:26,270 INFO L435 NwaCegarLoop]: 395 mSDtfsCounter, 30 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:26,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 1166 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:16:26,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2025-03-17 19:16:26,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2025-03-17 19:16:26,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 319 states have (on average 1.4169278996865204) internal successors, (452), 324 states have internal predecessors, (452), 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-17 19:16:26,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 458 transitions. [2025-03-17 19:16:26,283 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 458 transitions. Word has length 64 [2025-03-17 19:16:26,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:26,283 INFO L471 AbstractCegarLoop]: Abstraction has 329 states and 458 transitions. [2025-03-17 19:16:26,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 458 transitions. [2025-03-17 19:16:26,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-17 19:16:26,286 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:26,286 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] [2025-03-17 19:16:26,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 19:16:26,287 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-17 19:16:26,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:26,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1113119575, now seen corresponding path program 1 times [2025-03-17 19:16:26,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:26,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692736121] [2025-03-17 19:16:26,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:26,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:26,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-17 19:16:26,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-17 19:16:26,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:26,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:26,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:16:26,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:26,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692736121] [2025-03-17 19:16:26,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692736121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:26,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:26,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:16:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684479875] [2025-03-17 19:16:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:16:26,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:26,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:16:26,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:16:26,572 INFO L87 Difference]: Start difference. First operand 329 states and 458 transitions. Second operand has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:26,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:26,715 INFO L93 Difference]: Finished difference Result 638 states and 894 transitions. [2025-03-17 19:16:26,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:16:26,715 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 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 64 [2025-03-17 19:16:26,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:26,717 INFO L225 Difference]: With dead ends: 638 [2025-03-17 19:16:26,718 INFO L226 Difference]: Without dead ends: 636 [2025-03-17 19:16:26,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:16:26,718 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 370 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 1268 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-17 19:16:26,719 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 1268 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:16:26,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2025-03-17 19:16:26,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 443. [2025-03-17 19:16:26,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.3995381062355658) internal successors, (606), 438 states have internal predecessors, (606), 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-17 19:16:26,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 612 transitions. [2025-03-17 19:16:26,734 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 612 transitions. Word has length 64 [2025-03-17 19:16:26,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:26,734 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 612 transitions. [2025-03-17 19:16:26,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.333333333333332) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:26,735 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 612 transitions. [2025-03-17 19:16:26,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 19:16:26,739 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:26,739 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] [2025-03-17 19:16:26,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 19:16:26,739 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:16:26,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:26,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1376773406, now seen corresponding path program 1 times [2025-03-17 19:16:26,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:26,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812423326] [2025-03-17 19:16:26,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:26,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:26,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:16:26,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:16:26,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:26,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:16:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:26,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812423326] [2025-03-17 19:16:26,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812423326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:26,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:26,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 19:16:26,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426099069] [2025-03-17 19:16:26,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:26,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:16:26,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:26,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:16:26,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:16:26,932 INFO L87 Difference]: Start difference. First operand 443 states and 612 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:27,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:27,049 INFO L93 Difference]: Finished difference Result 881 states and 1218 transitions. [2025-03-17 19:16:27,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:16:27,049 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-03-17 19:16:27,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:27,052 INFO L225 Difference]: With dead ends: 881 [2025-03-17 19:16:27,053 INFO L226 Difference]: Without dead ends: 446 [2025-03-17 19:16:27,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:16:27,054 INFO L435 NwaCegarLoop]: 386 mSDtfsCounter, 105 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:27,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1074 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:16:27,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-17 19:16:27,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 443. [2025-03-17 19:16:27,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 433 states have (on average 1.3833718244803694) internal successors, (599), 438 states have internal predecessors, (599), 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-17 19:16:27,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 605 transitions. [2025-03-17 19:16:27,069 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 605 transitions. Word has length 79 [2025-03-17 19:16:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:27,071 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 605 transitions. [2025-03-17 19:16:27,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 605 transitions. [2025-03-17 19:16:27,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 19:16:27,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:27,073 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] [2025-03-17 19:16:27,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 19:16:27,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:16:27,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:27,074 INFO L85 PathProgramCache]: Analyzing trace with hash -9170313, now seen corresponding path program 1 times [2025-03-17 19:16:27,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:27,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684951785] [2025-03-17 19:16:27,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:27,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:27,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:16:27,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:16:27,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:27,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:16:27,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:27,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684951785] [2025-03-17 19:16:27,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684951785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:27,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:27,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:16:27,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355044687] [2025-03-17 19:16:27,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:27,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:16:27,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:27,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:16:27,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:16:27,234 INFO L87 Difference]: Start difference. First operand 443 states and 605 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:27,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:27,317 INFO L93 Difference]: Finished difference Result 884 states and 1210 transitions. [2025-03-17 19:16:27,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:16:27,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 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 79 [2025-03-17 19:16:27,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:27,319 INFO L225 Difference]: With dead ends: 884 [2025-03-17 19:16:27,320 INFO L226 Difference]: Without dead ends: 449 [2025-03-17 19:16:27,320 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:16:27,321 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 1 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:27,321 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 778 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:16:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-17 19:16:27,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 449. [2025-03-17 19:16:27,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 439 states have (on average 1.3781321184510251) internal successors, (605), 444 states have internal predecessors, (605), 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-17 19:16:27,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 611 transitions. [2025-03-17 19:16:27,339 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 611 transitions. Word has length 79 [2025-03-17 19:16:27,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:27,339 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 611 transitions. [2025-03-17 19:16:27,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:27,340 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 611 transitions. [2025-03-17 19:16:27,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-17 19:16:27,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:27,341 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] [2025-03-17 19:16:27,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 19:16:27,342 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:16:27,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:27,342 INFO L85 PathProgramCache]: Analyzing trace with hash 231369816, now seen corresponding path program 1 times [2025-03-17 19:16:27,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:27,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557670084] [2025-03-17 19:16:27,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:27,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:27,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-17 19:16:27,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-17 19:16:27,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:27,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:27,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 19:16:27,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:27,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557670084] [2025-03-17 19:16:27,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557670084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:27,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:27,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 19:16:27,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525855949] [2025-03-17 19:16:27,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:27,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:16:27,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:27,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:16:27,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:16:27,482 INFO L87 Difference]: Start difference. First operand 449 states and 611 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:27,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:27,600 INFO L93 Difference]: Finished difference Result 1210 states and 1657 transitions. [2025-03-17 19:16:27,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:16:27,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 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 79 [2025-03-17 19:16:27,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:27,604 INFO L225 Difference]: With dead ends: 1210 [2025-03-17 19:16:27,605 INFO L226 Difference]: Without dead ends: 769 [2025-03-17 19:16:27,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 19:16:27,606 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 256 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:27,606 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 795 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:16:27,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-03-17 19:16:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 767. [2025-03-17 19:16:27,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 757 states have (on average 1.3817701453104358) internal successors, (1046), 762 states have internal predecessors, (1046), 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-17 19:16:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1052 transitions. [2025-03-17 19:16:27,631 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1052 transitions. Word has length 79 [2025-03-17 19:16:27,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:27,631 INFO L471 AbstractCegarLoop]: Abstraction has 767 states and 1052 transitions. [2025-03-17 19:16:27,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 2 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 19:16:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1052 transitions. [2025-03-17 19:16:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 19:16:27,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:27,651 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] [2025-03-17 19:16:27,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 19:16:27,652 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:16:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:27,653 INFO L85 PathProgramCache]: Analyzing trace with hash 2003342785, now seen corresponding path program 1 times [2025-03-17 19:16:27,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:27,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246486334] [2025-03-17 19:16:27,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:27,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:27,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 19:16:27,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 19:16:27,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:27,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-17 19:16:27,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:27,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246486334] [2025-03-17 19:16:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246486334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:27,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:27,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 19:16:27,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690787685] [2025-03-17 19:16:27,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:27,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 19:16:27,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:27,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 19:16:27,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 19:16:27,930 INFO L87 Difference]: Start difference. First operand 767 states and 1052 transitions. Second operand has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:16:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:28,067 INFO L93 Difference]: Finished difference Result 832 states and 1137 transitions. [2025-03-17 19:16:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 19:16:28,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 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 94 [2025-03-17 19:16:28,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:28,071 INFO L225 Difference]: With dead ends: 832 [2025-03-17 19:16:28,071 INFO L226 Difference]: Without dead ends: 830 [2025-03-17 19:16:28,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 19:16:28,071 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 335 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:28,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 1247 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 19:16:28,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2025-03-17 19:16:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2025-03-17 19:16:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 817 states have (on average 1.3745410036719705) internal successors, (1123), 822 states have internal predecessors, (1123), 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-17 19:16:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1135 transitions. [2025-03-17 19:16:28,091 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1135 transitions. Word has length 94 [2025-03-17 19:16:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:28,091 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1135 transitions. [2025-03-17 19:16:28,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.0) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:16:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1135 transitions. [2025-03-17 19:16:28,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-17 19:16:28,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:28,093 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] [2025-03-17 19:16:28,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 19:16:28,093 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-17 19:16:28,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:28,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1960990064, now seen corresponding path program 1 times [2025-03-17 19:16:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:28,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637790481] [2025-03-17 19:16:28,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:28,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:28,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 19:16:28,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 19:16:28,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:28,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:28,421 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-17 19:16:28,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637790481] [2025-03-17 19:16:28,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637790481] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:16:28,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [385978893] [2025-03-17 19:16:28,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:28,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:28,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:28,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:16:28,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 19:16:28,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-17 19:16:28,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-17 19:16:28,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:28,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:28,664 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-17 19:16:28,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:16:28,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:16:28,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:16:28,708 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 23 treesize of output 22 [2025-03-17 19:16:29,316 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-17 19:16:29,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:16:29,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [385978893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:29,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:16:29,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-17 19:16:29,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274724540] [2025-03-17 19:16:29,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:29,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 19:16:29,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:29,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 19:16:29,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:16:29,318 INFO L87 Difference]: Start difference. First operand 830 states and 1135 transitions. Second operand has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:16:30,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:30,761 INFO L93 Difference]: Finished difference Result 1518 states and 2069 transitions. [2025-03-17 19:16:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 19:16:30,761 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 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 100 [2025-03-17 19:16:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:30,765 INFO L225 Difference]: With dead ends: 1518 [2025-03-17 19:16:30,765 INFO L226 Difference]: Without dead ends: 866 [2025-03-17 19:16:30,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-17 19:16:30,767 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 674 mSDsluCounter, 1859 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 1084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:30,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 2278 Invalid, 1084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-17 19:16:30,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-03-17 19:16:30,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 861. [2025-03-17 19:16:30,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 848 states have (on average 1.366745283018868) internal successors, (1159), 853 states have internal predecessors, (1159), 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-17 19:16:30,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1171 transitions. [2025-03-17 19:16:30,792 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1171 transitions. Word has length 100 [2025-03-17 19:16:30,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:30,793 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1171 transitions. [2025-03-17 19:16:30,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.454545454545455) internal successors, (93), 11 states have internal predecessors, (93), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 19:16:30,793 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1171 transitions. [2025-03-17 19:16:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 19:16:30,797 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:30,797 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-17 19:16:30,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 19:16:30,997 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-17 19:16:30,997 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-17 19:16:30,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1093547465, now seen corresponding path program 1 times [2025-03-17 19:16:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:30,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454789143] [2025-03-17 19:16:30,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:30,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:31,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 19:16:31,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 19:16:31,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:31,160 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:31,326 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-17 19:16:31,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:31,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454789143] [2025-03-17 19:16:31,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454789143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:16:31,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685090432] [2025-03-17 19:16:31,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:31,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:31,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:31,334 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:16:31,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 19:16:31,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 19:16:31,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 19:16:31,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:31,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:31,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 19:16:31,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:16:31,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:16:31,762 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-17 19:16:31,762 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:16:31,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685090432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:31,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:16:31,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2025-03-17 19:16:31,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891152022] [2025-03-17 19:16:31,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:31,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:16:31,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:31,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:16:31,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:16:31,764 INFO L87 Difference]: Start difference. First operand 861 states and 1171 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-17 19:16:31,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:31,967 INFO L93 Difference]: Finished difference Result 1474 states and 2003 transitions. [2025-03-17 19:16:31,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:16:31,968 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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 101 [2025-03-17 19:16:31,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:31,972 INFO L225 Difference]: With dead ends: 1474 [2025-03-17 19:16:31,972 INFO L226 Difference]: Without dead ends: 872 [2025-03-17 19:16:31,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-17 19:16:31,973 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 384 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1922 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:31,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1922 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:16:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-17 19:16:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 864. [2025-03-17 19:16:31,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 864 states, 850 states have (on average 1.3670588235294117) internal successors, (1162), 856 states have internal predecessors, (1162), 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-17 19:16:31,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 864 states to 864 states and 1176 transitions. [2025-03-17 19:16:31,999 INFO L78 Accepts]: Start accepts. Automaton has 864 states and 1176 transitions. Word has length 101 [2025-03-17 19:16:31,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:31,999 INFO L471 AbstractCegarLoop]: Abstraction has 864 states and 1176 transitions. [2025-03-17 19:16:31,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 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-17 19:16:31,999 INFO L276 IsEmpty]: Start isEmpty. Operand 864 states and 1176 transitions. [2025-03-17 19:16:32,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 19:16:32,000 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:32,001 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] [2025-03-17 19:16:32,009 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-17 19:16:32,202 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-17 19:16:32,204 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-17 19:16:32,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:32,205 INFO L85 PathProgramCache]: Analyzing trace with hash -967575475, now seen corresponding path program 1 times [2025-03-17 19:16:32,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:32,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153230237] [2025-03-17 19:16:32,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:32,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:32,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 19:16:32,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 19:16:32,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:32,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:32,567 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-17 19:16:32,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153230237] [2025-03-17 19:16:32,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153230237] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:16:32,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340884118] [2025-03-17 19:16:32,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:32,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:32,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:32,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:16:32,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 19:16:32,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 19:16:32,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 19:16:32,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:32,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:32,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 19:16:32,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:16:32,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:16:32,871 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:16:32,883 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 23 treesize of output 22 [2025-03-17 19:16:33,467 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:16:33,467 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:16:33,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340884118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:33,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:16:33,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [5] total 15 [2025-03-17 19:16:33,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208380857] [2025-03-17 19:16:33,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:33,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 19:16:33,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:33,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 19:16:33,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-03-17 19:16:33,469 INFO L87 Difference]: Start difference. First operand 864 states and 1176 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-17 19:16:38,728 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 [0] [2025-03-17 19:16:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:38,949 INFO L93 Difference]: Finished difference Result 1571 states and 2139 transitions. [2025-03-17 19:16:38,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 19:16:38,950 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 103 [2025-03-17 19:16:38,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:38,953 INFO L225 Difference]: With dead ends: 1571 [2025-03-17 19:16:38,953 INFO L226 Difference]: Without dead ends: 921 [2025-03-17 19:16:38,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2025-03-17 19:16:38,956 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 746 mSDsluCounter, 2063 mSDsCounter, 0 mSdLazyCounter, 1011 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 2479 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1011 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:38,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 2479 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1011 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2025-03-17 19:16:38,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-17 19:16:38,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 899. [2025-03-17 19:16:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 885 states have (on average 1.3638418079096044) internal successors, (1207), 891 states have internal predecessors, (1207), 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-17 19:16:38,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1221 transitions. [2025-03-17 19:16:38,979 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1221 transitions. Word has length 103 [2025-03-17 19:16:38,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:38,979 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1221 transitions. [2025-03-17 19:16:38,979 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-17 19:16:38,979 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1221 transitions. [2025-03-17 19:16:38,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 19:16:38,980 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:38,981 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] [2025-03-17 19:16:38,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 19:16:39,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:39,185 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-17 19:16:39,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1266961299, now seen corresponding path program 1 times [2025-03-17 19:16:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:39,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107200338] [2025-03-17 19:16:39,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:39,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:39,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 19:16:39,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 19:16:39,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:39,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:39,456 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:16:39,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:39,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107200338] [2025-03-17 19:16:39,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107200338] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:39,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:39,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 19:16:39,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449222434] [2025-03-17 19:16:39,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:39,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:16:39,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:39,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:16:39,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:16:39,459 INFO L87 Difference]: Start difference. First operand 899 states and 1221 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-17 19:16:39,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:39,917 INFO L93 Difference]: Finished difference Result 1608 states and 2188 transitions. [2025-03-17 19:16:39,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 19:16:39,918 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 104 [2025-03-17 19:16:39,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:39,920 INFO L225 Difference]: With dead ends: 1608 [2025-03-17 19:16:39,920 INFO L226 Difference]: Without dead ends: 933 [2025-03-17 19:16:39,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:16:39,921 INFO L435 NwaCegarLoop]: 388 mSDtfsCounter, 14 mSDsluCounter, 1398 mSDsCounter, 0 mSdLazyCounter, 846 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:39,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1786 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 846 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:16:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-17 19:16:39,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 927. [2025-03-17 19:16:39,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 927 states, 913 states have (on average 1.3636363636363635) internal successors, (1245), 919 states have internal predecessors, (1245), 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-17 19:16:39,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 1259 transitions. [2025-03-17 19:16:39,942 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 1259 transitions. Word has length 104 [2025-03-17 19:16:39,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:39,942 INFO L471 AbstractCegarLoop]: Abstraction has 927 states and 1259 transitions. [2025-03-17 19:16:39,942 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-17 19:16:39,942 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 1259 transitions. [2025-03-17 19:16:39,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 19:16:39,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:39,943 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] [2025-03-17 19:16:39,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 19:16:39,943 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-17 19:16:39,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:39,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1309709647, now seen corresponding path program 1 times [2025-03-17 19:16:39,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:39,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255975612] [2025-03-17 19:16:39,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:39,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:39,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 19:16:39,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 19:16:39,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:39,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:16:40,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:40,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255975612] [2025-03-17 19:16:40,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255975612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:40,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 19:16:40,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 19:16:40,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627158066] [2025-03-17 19:16:40,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:40,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 19:16:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:40,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 19:16:40,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:16:40,176 INFO L87 Difference]: Start difference. First operand 927 states and 1259 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-17 19:16:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:40,503 INFO L93 Difference]: Finished difference Result 1634 states and 2222 transitions. [2025-03-17 19:16:40,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 19:16:40,504 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 104 [2025-03-17 19:16:40,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:40,507 INFO L225 Difference]: With dead ends: 1634 [2025-03-17 19:16:40,507 INFO L226 Difference]: Without dead ends: 933 [2025-03-17 19:16:40,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 19:16:40,508 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 9 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1263 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:40,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1263 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 19:16:40,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 933 states. [2025-03-17 19:16:40,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 933 to 933. [2025-03-17 19:16:40,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 933 states, 919 states have (on average 1.3612622415669207) internal successors, (1251), 925 states have internal predecessors, (1251), 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-17 19:16:40,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 933 states to 933 states and 1265 transitions. [2025-03-17 19:16:40,526 INFO L78 Accepts]: Start accepts. Automaton has 933 states and 1265 transitions. Word has length 104 [2025-03-17 19:16:40,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:40,526 INFO L471 AbstractCegarLoop]: Abstraction has 933 states and 1265 transitions. [2025-03-17 19:16:40,527 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-17 19:16:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 933 states and 1265 transitions. [2025-03-17 19:16:40,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 19:16:40,528 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:40,528 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] [2025-03-17 19:16:40,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 19:16:40,528 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-17 19:16:40,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:40,529 INFO L85 PathProgramCache]: Analyzing trace with hash -448555610, now seen corresponding path program 1 times [2025-03-17 19:16:40,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:40,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834303575] [2025-03-17 19:16:40,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:40,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:40,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:16:40,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:16:40,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:40,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:40,789 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-17 19:16:40,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834303575] [2025-03-17 19:16:40,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834303575] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:16:40,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620126331] [2025-03-17 19:16:40,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:40,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:40,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:40,791 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:16:40,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 19:16:40,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:16:41,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:16:41,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:41,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:41,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 19:16:41,097 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:16:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-17 19:16:41,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:16:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620126331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:41,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:16:41,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2025-03-17 19:16:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014934243] [2025-03-17 19:16:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:41,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 19:16:41,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:41,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 19:16:41,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 19:16:41,173 INFO L87 Difference]: Start difference. First operand 933 states and 1265 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-17 19:16:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:41,643 INFO L93 Difference]: Finished difference Result 1662 states and 2259 transitions. [2025-03-17 19:16:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 19:16:41,644 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 105 [2025-03-17 19:16:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:41,647 INFO L225 Difference]: With dead ends: 1662 [2025-03-17 19:16:41,647 INFO L226 Difference]: Without dead ends: 951 [2025-03-17 19:16:41,648 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 19:16:41,649 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 42 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 804 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1874 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:41,649 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1874 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 804 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 19:16:41,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-17 19:16:41,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 935. [2025-03-17 19:16:41,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 921 states have (on average 1.3604777415852334) internal successors, (1253), 927 states have internal predecessors, (1253), 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-17 19:16:41,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1267 transitions. [2025-03-17 19:16:41,667 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1267 transitions. Word has length 105 [2025-03-17 19:16:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:41,668 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1267 transitions. [2025-03-17 19:16:41,668 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-17 19:16:41,668 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1267 transitions. [2025-03-17 19:16:41,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 19:16:41,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:41,669 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] [2025-03-17 19:16:41,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 19:16:41,869 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,SelfDestructingSolverStorable13 [2025-03-17 19:16:41,870 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-17 19:16:41,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:41,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1211999514, now seen corresponding path program 1 times [2025-03-17 19:16:41,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:41,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601249356] [2025-03-17 19:16:41,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:41,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:41,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:16:41,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:16:41,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:41,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:42,169 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-17 19:16:42,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:42,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601249356] [2025-03-17 19:16:42,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601249356] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:16:42,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428927121] [2025-03-17 19:16:42,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:42,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:42,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:42,172 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:16:42,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 19:16:42,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 19:16:42,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 19:16:42,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:42,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:42,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 19:16:42,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:16:42,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:16:42,804 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:16:42,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:16:43,017 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 19:16:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428927121] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:16:43,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:16:43,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 17 [2025-03-17 19:16:43,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205359667] [2025-03-17 19:16:43,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:16:43,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-17 19:16:43,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:43,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-17 19:16:43,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-17 19:16:43,019 INFO L87 Difference]: Start difference. First operand 935 states and 1267 transitions. Second operand has 17 states, 17 states have (on average 11.941176470588236) internal successors, (203), 17 states have internal predecessors, (203), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 19:16:47,755 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-17 19:16:51,764 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-17 19:16:55,769 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-17 19:16:55,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:55,893 INFO L93 Difference]: Finished difference Result 1690 states and 2290 transitions. [2025-03-17 19:16:55,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-17 19:16:55,894 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 11.941176470588236) internal successors, (203), 17 states have internal predecessors, (203), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 105 [2025-03-17 19:16:55,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:55,897 INFO L225 Difference]: With dead ends: 1690 [2025-03-17 19:16:55,897 INFO L226 Difference]: Without dead ends: 1032 [2025-03-17 19:16:55,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 196 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-03-17 19:16:55,899 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 762 mSDsluCounter, 4905 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 5358 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:55,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 5358 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 882 Invalid, 3 Unknown, 0 Unchecked, 12.6s Time] [2025-03-17 19:16:55,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-03-17 19:16:55,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1019. [2025-03-17 19:16:55,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1019 states, 1000 states have (on average 1.363) internal successors, (1363), 1006 states have internal predecessors, (1363), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-17 19:16:55,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1019 states to 1019 states and 1384 transitions. [2025-03-17 19:16:55,923 INFO L78 Accepts]: Start accepts. Automaton has 1019 states and 1384 transitions. Word has length 105 [2025-03-17 19:16:55,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:55,923 INFO L471 AbstractCegarLoop]: Abstraction has 1019 states and 1384 transitions. [2025-03-17 19:16:55,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.941176470588236) internal successors, (203), 17 states have internal predecessors, (203), 3 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-17 19:16:55,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1019 states and 1384 transitions. [2025-03-17 19:16:55,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 19:16:55,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:55,924 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] [2025-03-17 19:16:55,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 19:16:56,124 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,SelfDestructingSolverStorable14 [2025-03-17 19:16:56,125 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-17 19:16:56,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:56,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1793493214, now seen corresponding path program 2 times [2025-03-17 19:16:56,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:56,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952432229] [2025-03-17 19:16:56,126 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:16:56,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:56,162 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-17 19:16:56,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 19:16:56,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:16:56,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:16:56,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952432229] [2025-03-17 19:16:56,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952432229] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:16:56,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760743304] [2025-03-17 19:16:56,395 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:16:56,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:56,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:56,398 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:16:56,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 19:16:56,633 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-03-17 19:16:56,641 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 7 of 109 statements. [2025-03-17 19:16:56,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 19:16:56,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:56,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 19:16:56,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:16:56,649 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-17 19:16:56,654 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-17 19:16:56,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 19:16:56,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [760743304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 19:16:56,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 19:16:56,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-17 19:16:56,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882937292] [2025-03-17 19:16:56,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 19:16:56,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 19:16:56,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:56,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 19:16:56,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:16:56,655 INFO L87 Difference]: Start difference. First operand 1019 states and 1384 transitions. Second operand has 3 states, 2 states have (on average 47.0) internal successors, (94), 3 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-17 19:16:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:56,715 INFO L93 Difference]: Finished difference Result 1019 states and 1384 transitions. [2025-03-17 19:16:56,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 19:16:56,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 47.0) internal successors, (94), 3 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 109 [2025-03-17 19:16:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:56,719 INFO L225 Difference]: With dead ends: 1019 [2025-03-17 19:16:56,719 INFO L226 Difference]: Without dead ends: 1018 [2025-03-17 19:16:56,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 19:16:56,720 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 1 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:56,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 802 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 19:16:56,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2025-03-17 19:16:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 1018. [2025-03-17 19:16:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1018 states, 1000 states have (on average 1.362) internal successors, (1362), 1005 states have internal predecessors, (1362), 7 states have call successors, (7), 4 states have call predecessors, (7), 6 states have return successors, (14), 8 states have call predecessors, (14), 7 states have call successors, (14) [2025-03-17 19:16:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1018 states to 1018 states and 1383 transitions. [2025-03-17 19:16:56,748 INFO L78 Accepts]: Start accepts. Automaton has 1018 states and 1383 transitions. Word has length 109 [2025-03-17 19:16:56,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:56,749 INFO L471 AbstractCegarLoop]: Abstraction has 1018 states and 1383 transitions. [2025-03-17 19:16:56,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 47.0) internal successors, (94), 3 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-17 19:16:56,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1018 states and 1383 transitions. [2025-03-17 19:16:56,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-17 19:16:56,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:56,750 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] [2025-03-17 19:16:56,757 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-17 19:16:56,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:56,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:16:56,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash 236285865, now seen corresponding path program 1 times [2025-03-17 19:16:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143307457] [2025-03-17 19:16:56,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:56,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:56,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 19:16:57,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 19:16:57,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:57,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:57,294 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:16:57,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143307457] [2025-03-17 19:16:57,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143307457] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:16:57,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1941187226] [2025-03-17 19:16:57,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 19:16:57,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:57,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:57,296 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:16:57,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-17 19:16:57,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-17 19:16:57,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-17 19:16:57,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 19:16:57,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:57,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 19:16:57,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:16:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 24 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 19:16:57,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 19:16:57,781 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:16:57,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1941187226] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 19:16:57,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 19:16:57,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 13 [2025-03-17 19:16:57,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344577963] [2025-03-17 19:16:57,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 19:16:57,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 19:16:57,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 19:16:57,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 19:16:57,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2025-03-17 19:16:57,782 INFO L87 Difference]: Start difference. First operand 1018 states and 1383 transitions. Second operand has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 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-17 19:16:58,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 19:16:58,004 INFO L93 Difference]: Finished difference Result 1725 states and 2343 transitions. [2025-03-17 19:16:58,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 19:16:58,004 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 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 110 [2025-03-17 19:16:58,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 19:16:58,009 INFO L225 Difference]: With dead ends: 1725 [2025-03-17 19:16:58,009 INFO L226 Difference]: Without dead ends: 850 [2025-03-17 19:16:58,010 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2025-03-17 19:16:58,010 INFO L435 NwaCegarLoop]: 324 mSDtfsCounter, 28 mSDsluCounter, 2228 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 19:16:58,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 2552 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 19:16:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2025-03-17 19:16:58,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 848. [2025-03-17 19:16:58,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 829 states have (on average 1.3425814234016888) internal successors, (1113), 835 states have internal predecessors, (1113), 7 states have call successors, (7), 4 states have call predecessors, (7), 7 states have return successors, (13), 8 states have call predecessors, (13), 7 states have call successors, (13) [2025-03-17 19:16:58,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1133 transitions. [2025-03-17 19:16:58,030 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1133 transitions. Word has length 110 [2025-03-17 19:16:58,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 19:16:58,030 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1133 transitions. [2025-03-17 19:16:58,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 9.0) internal successors, (117), 13 states have internal predecessors, (117), 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-17 19:16:58,030 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1133 transitions. [2025-03-17 19:16:58,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-17 19:16:58,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 19:16:58,032 INFO L218 NwaCegarLoop]: trace histogram [10, 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] [2025-03-17 19:16:58,041 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-17 19:16:58,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-17 19:16:58,233 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-17 19:16:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 19:16:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash -255806807, now seen corresponding path program 2 times [2025-03-17 19:16:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 19:16:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352504792] [2025-03-17 19:16:58,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:16:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 19:16:58,265 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-17 19:16:58,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 19:16:58,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:16:58,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 6 proven. 58 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 19:16:58,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 19:16:58,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352504792] [2025-03-17 19:16:58,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352504792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 19:16:58,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658509909] [2025-03-17 19:16:58,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 19:16:58,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 19:16:58,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 19:16:58,736 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 19:16:58,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-17 19:16:58,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-17 19:16:59,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-17 19:16:59,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 19:16:59,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 19:16:59,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 761 conjuncts, 145 conjuncts are in the unsatisfiable core [2025-03-17 19:16:59,188 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 19:16:59,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:16:59,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 19:16:59,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 19:16:59,232 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 23 treesize of output 22 [2025-03-17 19:16:59,367 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 7 treesize of output 3 [2025-03-17 19:16:59,400 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 13 treesize of output 9 [2025-03-17 19:16:59,418 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-03-17 19:16:59,418 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-17 19:16:59,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 19:16:59,481 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-17 19:16:59,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-17 19:16:59,660 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 19:16:59,660 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 62 treesize of output 57 [2025-03-17 19:16:59,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 19:17:42,010 INFO L224 Elim1Store]: Index analysis took 908 ms