./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:03:28,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:03:28,195 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:03:28,206 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:03:28,206 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:03:28,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:03:28,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:03:28,249 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:03:28,249 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:03:28,249 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:03:28,249 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:03:28,249 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:03:28,250 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:03:28,250 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:03:28,251 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:03:28,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:03:28,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:03:28,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:03:28,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:03:28,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:03:28,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:03:28,256 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:03:28,256 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:03:28,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:03:28,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:03:28,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:03:28,257 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 -> 6fd297418200393a9bb890e84311a80b6eacd7d5d7cdd65efb1397f8b8ab870f [2025-03-09 06:03:28,701 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:03:28,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:03:28,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:03:28,726 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:03:28,726 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:03:28,728 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2025-03-09 06:03:30,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bb37b8e/1f104816e0094c4d948e45732fb12bc1/FLAGc82421e64 [2025-03-09 06:03:31,016 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:03:31,016 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test3-1.i [2025-03-09 06:03:31,052 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bb37b8e/1f104816e0094c4d948e45732fb12bc1/FLAGc82421e64 [2025-03-09 06:03:31,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8bb37b8e/1f104816e0094c4d948e45732fb12bc1 [2025-03-09 06:03:31,087 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:03:31,089 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:03:31,095 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:03:31,095 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:03:31,099 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:03:31,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:03:31" (1/1) ... [2025-03-09 06:03:31,108 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a11529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:31, skipping insertion in model container [2025-03-09 06:03:31,108 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:03:31" (1/1) ... [2025-03-09 06:03:31,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:03:31,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:03:31,907 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:03:32,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:03:32,150 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:03:32,151 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32 WrapperNode [2025-03-09 06:03:32,151 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:03:32,152 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:03:32,154 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:03:32,154 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:03:32,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,198 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,311 INFO L138 Inliner]: procedures = 177, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1397 [2025-03-09 06:03:32,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:03:32,319 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:03:32,319 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:03:32,320 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:03:32,336 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,474 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-09 06:03:32,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,476 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,542 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,573 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:03:32,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:03:32,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:03:32,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:03:32,593 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (1/1) ... [2025-03-09 06:03:32,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:03:32,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:32,666 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:03:32,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 06:03:32,714 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 06:03:32,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 06:03:32,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 06:03:32,714 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:03:32,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 06:03:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:03:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:03:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:03:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 06:03:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:03:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:03:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:03:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:03:32,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:03:32,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:03:32,996 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:03:32,998 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:03:34,936 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: 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-09 06:03:35,093 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2025-03-09 06:03:35,094 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:03:35,188 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:03:35,192 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 06:03:35,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:03:35 BoogieIcfgContainer [2025-03-09 06:03:35,192 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:03:35,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:03:35,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:03:35,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:03:35,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:03:31" (1/3) ... [2025-03-09 06:03:35,206 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7680d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:03:35, skipping insertion in model container [2025-03-09 06:03:35,206 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:03:32" (2/3) ... [2025-03-09 06:03:35,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7680d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:03:35, skipping insertion in model container [2025-03-09 06:03:35,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:03:35" (3/3) ... [2025-03-09 06:03:35,209 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test3-1.i [2025-03-09 06:03:35,231 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:03:35,237 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_FNV_nondet_test3-1.i that has 5 procedures, 415 locations, 1 initial locations, 36 loop locations, and 6 error locations. [2025-03-09 06:03:35,327 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:03:35,340 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;@a0aad8b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:03:35,343 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:03:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 407 states, 393 states have (on average 1.623409669211196) internal successors, (638), 400 states have internal predecessors, (638), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-09 06:03:35,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 06:03:35,365 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:35,366 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:35,366 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-09 06:03:35,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1991908556, now seen corresponding path program 1 times [2025-03-09 06:03:35,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:35,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698330020] [2025-03-09 06:03:35,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:35,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:35,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:03:35,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:03:35,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:35,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:35,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:35,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698330020] [2025-03-09 06:03:35,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698330020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:35,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:35,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:03:35,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540131447] [2025-03-09 06:03:35,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:35,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 06:03:35,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:35,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:03:35,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:03:35,663 INFO L87 Difference]: Start difference. First operand has 407 states, 393 states have (on average 1.623409669211196) internal successors, (638), 400 states have internal predecessors, (638), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:35,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:35,853 INFO L93 Difference]: Finished difference Result 810 states and 1293 transitions. [2025-03-09 06:03:35,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:03:35,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 06:03:35,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:35,869 INFO L225 Difference]: With dead ends: 810 [2025-03-09 06:03:35,874 INFO L226 Difference]: Without dead ends: 398 [2025-03-09 06:03:35,877 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-09 06:03:35,884 INFO L435 NwaCegarLoop]: 541 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, 541 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-09 06:03:35,887 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:03:35,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-09 06:03:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-03-09 06:03:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 386 states have (on average 1.461139896373057) internal successors, (564), 392 states have internal predecessors, (564), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 06:03:35,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 572 transitions. [2025-03-09 06:03:35,990 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 572 transitions. Word has length 8 [2025-03-09 06:03:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:35,994 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 572 transitions. [2025-03-09 06:03:35,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:35,994 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 572 transitions. [2025-03-09 06:03:35,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 06:03:35,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:35,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:35,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:03:35,995 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-09 06:03:35,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:35,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1991907595, now seen corresponding path program 1 times [2025-03-09 06:03:35,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:35,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307147751] [2025-03-09 06:03:35,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:35,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:36,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:03:36,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:03:36,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:36,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:03:36,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1525388527] [2025-03-09 06:03:36,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:36,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:36,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:36,107 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:36,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:03:36,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:03:36,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:03:36,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:36,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:36,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:03:36,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:36,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:36,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:36,459 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:36,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:36,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307147751] [2025-03-09 06:03:36,460 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 06:03:36,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1525388527] [2025-03-09 06:03:36,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1525388527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:36,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:36,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481446240] [2025-03-09 06:03:36,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:36,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:36,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:36,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:36,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:36,462 INFO L87 Difference]: Start difference. First operand 398 states and 572 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:36,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:36,874 INFO L93 Difference]: Finished difference Result 785 states and 1134 transitions. [2025-03-09 06:03:36,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:36,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-09 06:03:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:36,885 INFO L225 Difference]: With dead ends: 785 [2025-03-09 06:03:36,885 INFO L226 Difference]: Without dead ends: 783 [2025-03-09 06:03:36,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:03:36,886 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 547 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1514 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:36,886 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [551 Valid, 1514 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 06:03:36,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-09 06:03:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 404. [2025-03-09 06:03:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 392 states have (on average 1.4566326530612246) internal successors, (571), 398 states have internal predecessors, (571), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 06:03:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 579 transitions. [2025-03-09 06:03:36,937 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 579 transitions. Word has length 8 [2025-03-09 06:03:36,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:36,937 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 579 transitions. [2025-03-09 06:03:36,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:36,937 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 579 transitions. [2025-03-09 06:03:36,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 06:03:36,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:36,939 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] [2025-03-09 06:03:36,962 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 06:03:37,145 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-09 06:03:37,145 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-09 06:03:37,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:37,146 INFO L85 PathProgramCache]: Analyzing trace with hash -568921142, now seen corresponding path program 1 times [2025-03-09 06:03:37,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:37,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596967004] [2025-03-09 06:03:37,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:37,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:37,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 06:03:37,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 06:03:37,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:37,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:37,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:37,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596967004] [2025-03-09 06:03:37,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596967004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:37,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:37,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:03:37,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722652178] [2025-03-09 06:03:37,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:37,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:37,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:37,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:37,585 INFO L87 Difference]: Start difference. First operand 404 states and 579 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 06:03:37,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:37,753 INFO L93 Difference]: Finished difference Result 552 states and 789 transitions. [2025-03-09 06:03:37,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:03:37,753 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2025-03-09 06:03:37,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:37,755 INFO L225 Difference]: With dead ends: 552 [2025-03-09 06:03:37,756 INFO L226 Difference]: Without dead ends: 362 [2025-03-09 06:03:37,759 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-09 06:03:37,759 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 36 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:37,760 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1291 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:03:37,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-09 06:03:37,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-03-09 06:03:37,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 362 states, 350 states have (on average 1.4114285714285715) internal successors, (494), 356 states have internal predecessors, (494), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 06:03:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 502 transitions. [2025-03-09 06:03:37,783 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 502 transitions. Word has length 69 [2025-03-09 06:03:37,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:37,783 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 502 transitions. [2025-03-09 06:03:37,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 06:03:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 502 transitions. [2025-03-09 06:03:37,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 06:03:37,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:37,785 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] [2025-03-09 06:03:37,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:03:37,785 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-09 06:03:37,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:37,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1492127488, now seen corresponding path program 1 times [2025-03-09 06:03:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:37,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463019472] [2025-03-09 06:03:37,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:37,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:37,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 06:03:37,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 06:03:37,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:37,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:37,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:37,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463019472] [2025-03-09 06:03:37,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463019472] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:37,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:37,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:03:37,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598931838] [2025-03-09 06:03:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:37,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:37,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:37,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:37,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:37,983 INFO L87 Difference]: Start difference. First operand 362 states and 502 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 06:03:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:38,184 INFO L93 Difference]: Finished difference Result 504 states and 695 transitions. [2025-03-09 06:03:38,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:03:38,185 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2025-03-09 06:03:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:38,186 INFO L225 Difference]: With dead ends: 504 [2025-03-09 06:03:38,190 INFO L226 Difference]: Without dead ends: 356 [2025-03-09 06:03:38,191 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-09 06:03:38,191 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 9 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:38,192 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1292 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:03:38,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-09 06:03:38,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-09 06:03:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 344 states have (on average 1.4069767441860466) internal successors, (484), 350 states have internal predecessors, (484), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-09 06:03:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 492 transitions. [2025-03-09 06:03:38,214 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 492 transitions. Word has length 69 [2025-03-09 06:03:38,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:38,214 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 492 transitions. [2025-03-09 06:03:38,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 06:03:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 492 transitions. [2025-03-09 06:03:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 06:03:38,219 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:38,222 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] [2025-03-09 06:03:38,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:03:38,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:38,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash -701635836, now seen corresponding path program 1 times [2025-03-09 06:03:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:38,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233844588] [2025-03-09 06:03:38,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:38,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:38,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 06:03:38,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 06:03:38,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:38,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:38,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:38,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233844588] [2025-03-09 06:03:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233844588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:38,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:38,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:03:38,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408317636] [2025-03-09 06:03:38,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:38,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:38,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:38,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:38,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:38,421 INFO L87 Difference]: Start difference. First operand 356 states and 492 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 06:03:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:38,538 INFO L93 Difference]: Finished difference Result 498 states and 681 transitions. [2025-03-09 06:03:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:38,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2025-03-09 06:03:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:38,540 INFO L225 Difference]: With dead ends: 498 [2025-03-09 06:03:38,540 INFO L226 Difference]: Without dead ends: 351 [2025-03-09 06:03:38,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:38,541 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 0 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:38,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1345 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:03:38,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-09 06:03:38,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-09 06:03:38,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 341 states have (on average 1.4076246334310851) internal successors, (480), 346 states have internal predecessors, (480), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 486 transitions. [2025-03-09 06:03:38,561 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 486 transitions. Word has length 69 [2025-03-09 06:03:38,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:38,561 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 486 transitions. [2025-03-09 06:03:38,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-09 06:03:38,562 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 486 transitions. [2025-03-09 06:03:38,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 06:03:38,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:38,565 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] [2025-03-09 06:03:38,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:03:38,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:38,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash -508576809, now seen corresponding path program 1 times [2025-03-09 06:03:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:38,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555941665] [2025-03-09 06:03:38,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:38,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 06:03:38,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 06:03:38,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:38,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:38,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:38,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555941665] [2025-03-09 06:03:38,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555941665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:38,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:38,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:38,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207985027] [2025-03-09 06:03:38,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:38,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:03:38,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:38,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:03:38,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:03:38,719 INFO L87 Difference]: Start difference. First operand 351 states and 486 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 06:03:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:38,858 INFO L93 Difference]: Finished difference Result 495 states and 677 transitions. [2025-03-09 06:03:38,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:03:38,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2025-03-09 06:03:38,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:38,865 INFO L225 Difference]: With dead ends: 495 [2025-03-09 06:03:38,865 INFO L226 Difference]: Without dead ends: 351 [2025-03-09 06:03:38,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:03:38,866 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 15 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:38,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 865 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:03:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-09 06:03:38,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-09 06:03:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 341 states have (on average 1.3958944281524928) internal successors, (476), 346 states have internal predecessors, (476), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 482 transitions. [2025-03-09 06:03:38,885 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 482 transitions. Word has length 70 [2025-03-09 06:03:38,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:38,885 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 482 transitions. [2025-03-09 06:03:38,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 06:03:38,885 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 482 transitions. [2025-03-09 06:03:38,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 06:03:38,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:38,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:38,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:03:38,890 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-09 06:03:38,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:38,891 INFO L85 PathProgramCache]: Analyzing trace with hash 623327717, now seen corresponding path program 1 times [2025-03-09 06:03:38,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:38,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185247264] [2025-03-09 06:03:38,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:38,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:38,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:03:38,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:03:38,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:38,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:39,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:39,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:39,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185247264] [2025-03-09 06:03:39,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185247264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:39,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:39,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:03:39,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120404181] [2025-03-09 06:03:39,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:39,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:39,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:39,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:39,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:39,261 INFO L87 Difference]: Start difference. First operand 351 states and 482 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:39,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:39,432 INFO L93 Difference]: Finished difference Result 696 states and 957 transitions. [2025-03-09 06:03:39,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:39,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-09 06:03:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:39,434 INFO L225 Difference]: With dead ends: 696 [2025-03-09 06:03:39,438 INFO L226 Difference]: Without dead ends: 354 [2025-03-09 06:03:39,439 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-09 06:03:39,439 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 105 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:39,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1161 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:03:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-09 06:03:39,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2025-03-09 06:03:39,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 341 states have (on average 1.3753665689149561) internal successors, (469), 346 states have internal predecessors, (469), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:39,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 475 transitions. [2025-03-09 06:03:39,463 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 475 transitions. Word has length 80 [2025-03-09 06:03:39,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:39,463 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 475 transitions. [2025-03-09 06:03:39,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 4 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:39,463 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2025-03-09 06:03:39,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 06:03:39,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:39,467 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:39,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:03:39,467 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-09 06:03:39,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:39,468 INFO L85 PathProgramCache]: Analyzing trace with hash -762616002, now seen corresponding path program 1 times [2025-03-09 06:03:39,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:39,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386723334] [2025-03-09 06:03:39,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:39,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:39,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:03:39,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:03:39,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:39,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:39,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:03:39,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:39,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386723334] [2025-03-09 06:03:39,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386723334] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:39,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:39,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:39,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943652397] [2025-03-09 06:03:39,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:39,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:03:39,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:39,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:03:39,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:03:39,725 INFO L87 Difference]: Start difference. First operand 351 states and 475 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:40,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:40,048 INFO L93 Difference]: Finished difference Result 906 states and 1240 transitions. [2025-03-09 06:03:40,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:03:40,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2025-03-09 06:03:40,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:40,051 INFO L225 Difference]: With dead ends: 906 [2025-03-09 06:03:40,051 INFO L226 Difference]: Without dead ends: 484 [2025-03-09 06:03:40,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:03:40,056 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 249 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:40,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 846 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 06:03:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-09 06:03:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2025-03-09 06:03:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 482 states, 472 states have (on average 1.396186440677966) internal successors, (659), 477 states have internal predecessors, (659), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-09 06:03:40,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 665 transitions. [2025-03-09 06:03:40,084 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 665 transitions. Word has length 80 [2025-03-09 06:03:40,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:40,084 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 665 transitions. [2025-03-09 06:03:40,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:03:40,085 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 665 transitions. [2025-03-09 06:03:40,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 06:03:40,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:40,087 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:40,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:03:40,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:03:40,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:40,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1886669036, now seen corresponding path program 1 times [2025-03-09 06:03:40,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:40,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234998791] [2025-03-09 06:03:40,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:40,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:40,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 06:03:40,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 06:03:40,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:40,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:40,470 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-09 06:03:40,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:40,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234998791] [2025-03-09 06:03:40,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234998791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:40,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:40,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:03:40,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470444168] [2025-03-09 06:03:40,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:40,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:03:40,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:40,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:03:40,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:03:40,473 INFO L87 Difference]: Start difference. First operand 482 states and 665 transitions. Second operand has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:40,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:40,616 INFO L93 Difference]: Finished difference Result 690 states and 936 transitions. [2025-03-09 06:03:40,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:03:40,617 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 95 [2025-03-09 06:03:40,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:40,619 INFO L225 Difference]: With dead ends: 690 [2025-03-09 06:03:40,619 INFO L226 Difference]: Without dead ends: 688 [2025-03-09 06:03:40,620 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-09 06:03:40,620 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 365 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:40,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1336 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:03:40,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-09 06:03:40,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 545. [2025-03-09 06:03:40,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 532 states have (on average 1.3834586466165413) internal successors, (736), 537 states have internal predecessors, (736), 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-09 06:03:40,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 748 transitions. [2025-03-09 06:03:40,635 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 748 transitions. Word has length 95 [2025-03-09 06:03:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 748 transitions. [2025-03-09 06:03:40,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:40,636 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 748 transitions. [2025-03-09 06:03:40,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 06:03:40,636 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:40,637 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-09 06:03:40,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:03:40,638 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-09 06:03:40,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:40,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1857425891, now seen corresponding path program 1 times [2025-03-09 06:03:40,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:40,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135818464] [2025-03-09 06:03:40,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:40,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:40,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:03:40,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:03:40,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:40,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:41,055 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-09 06:03:41,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135818464] [2025-03-09 06:03:41,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135818464] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1232304791] [2025-03-09 06:03:41,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:41,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:41,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:41,063 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:41,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:03:41,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:03:41,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:03:41,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:41,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:41,500 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:03:41,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:41,521 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:41,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:41,569 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-09 06:03:42,428 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-09 06:03:42,429 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:42,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1232304791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:42,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:42,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-09 06:03:42,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670098754] [2025-03-09 06:03:42,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:42,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:03:42,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:42,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:03:42,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:03:42,430 INFO L87 Difference]: Start difference. First operand 545 states and 748 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:45,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:45,049 INFO L93 Difference]: Finished difference Result 1194 states and 1622 transitions. [2025-03-09 06:03:45,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:03:45,052 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 101 [2025-03-09 06:03:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:45,058 INFO L225 Difference]: With dead ends: 1194 [2025-03-09 06:03:45,058 INFO L226 Difference]: Without dead ends: 736 [2025-03-09 06:03:45,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:03:45,065 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 720 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:45,065 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 2327 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-09 06:03:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-09 06:03:45,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 570. [2025-03-09 06:03:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 557 states have (on average 1.3752244165170557) internal successors, (766), 562 states have internal predecessors, (766), 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-09 06:03:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 778 transitions. [2025-03-09 06:03:45,101 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 778 transitions. Word has length 101 [2025-03-09 06:03:45,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:45,102 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 778 transitions. [2025-03-09 06:03:45,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:03:45,105 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 778 transitions. [2025-03-09 06:03:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 06:03:45,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:45,107 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:45,122 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-09 06:03:45,307 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,SelfDestructingSolverStorable9 [2025-03-09 06:03:45,308 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-09 06:03:45,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:45,309 INFO L85 PathProgramCache]: Analyzing trace with hash 850268527, now seen corresponding path program 1 times [2025-03-09 06:03:45,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:45,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754457048] [2025-03-09 06:03:45,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:45,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:03:45,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:03:45,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:45,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:46,015 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-09 06:03:46,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754457048] [2025-03-09 06:03:46,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754457048] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695111218] [2025-03-09 06:03:46,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:46,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:46,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:46,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:46,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:03:46,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:03:46,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:03:46,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:46,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:46,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 06:03:46,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:03:46,677 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:46,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:03:46,702 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-09 06:03:47,463 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-09 06:03:47,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:03:47,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695111218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:47,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:03:47,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-09 06:03:47,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582550249] [2025-03-09 06:03:47,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:47,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:03:47,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:47,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:03:47,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:03:47,466 INFO L87 Difference]: Start difference. First operand 570 states and 778 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-09 06:03:49,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:49,126 INFO L93 Difference]: Finished difference Result 1241 states and 1685 transitions. [2025-03-09 06:03:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:03:49,126 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.916666666666667) internal successors, (95), 12 states have internal predecessors, (95), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 102 [2025-03-09 06:03:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:49,129 INFO L225 Difference]: With dead ends: 1241 [2025-03-09 06:03:49,129 INFO L226 Difference]: Without dead ends: 788 [2025-03-09 06:03:49,130 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:03:49,130 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 803 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:49,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 1955 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 06:03:49,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-09 06:03:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 605. [2025-03-09 06:03:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 592 states have (on average 1.3699324324324325) internal successors, (811), 597 states have internal predecessors, (811), 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-09 06:03:49,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 823 transitions. [2025-03-09 06:03:49,155 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 823 transitions. Word has length 102 [2025-03-09 06:03:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:49,158 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 823 transitions. [2025-03-09 06:03:49,159 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-09 06:03:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 823 transitions. [2025-03-09 06:03:49,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 06:03:49,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:49,159 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:49,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:03:49,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:49,360 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-09 06:03:49,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:49,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1604152320, now seen corresponding path program 1 times [2025-03-09 06:03:49,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:49,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340418998] [2025-03-09 06:03:49,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:49,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:49,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 06:03:49,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:03:49,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:49,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:49,810 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-09 06:03:49,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:49,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340418998] [2025-03-09 06:03:49,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340418998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:49,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:49,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:03:49,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647759796] [2025-03-09 06:03:49,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:49,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:03:49,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:49,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:03:49,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:03:49,812 INFO L87 Difference]: Start difference. First operand 605 states and 823 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-09 06:03:50,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:50,377 INFO L93 Difference]: Finished difference Result 1112 states and 1515 transitions. [2025-03-09 06:03:50,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:03:50,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-09 06:03:50,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:50,380 INFO L225 Difference]: With dead ends: 1112 [2025-03-09 06:03:50,380 INFO L226 Difference]: Without dead ends: 627 [2025-03-09 06:03:50,381 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-09 06:03:50,382 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 9 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1659 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:50,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1659 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:03:50,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-09 06:03:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 623. [2025-03-09 06:03:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 610 states have (on average 1.3704918032786886) internal successors, (836), 615 states have internal predecessors, (836), 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-09 06:03:50,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 848 transitions. [2025-03-09 06:03:50,396 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 848 transitions. Word has length 103 [2025-03-09 06:03:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:50,397 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 848 transitions. [2025-03-09 06:03:50,397 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-09 06:03:50,397 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 848 transitions. [2025-03-09 06:03:50,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 06:03:50,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:50,398 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:50,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:03:50,398 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-09 06:03:50,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:50,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1202592956, now seen corresponding path program 1 times [2025-03-09 06:03:50,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:50,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845292530] [2025-03-09 06:03:50,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:50,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:50,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 06:03:50,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:03:50,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:50,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:50,665 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-09 06:03:50,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:50,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845292530] [2025-03-09 06:03:50,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845292530] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:03:50,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:03:50,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:03:50,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374991675] [2025-03-09 06:03:50,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:03:50,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:03:50,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:03:50,666 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:03:50,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:03:50,666 INFO L87 Difference]: Start difference. First operand 623 states and 848 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-09 06:03:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:03:51,138 INFO L93 Difference]: Finished difference Result 1137 states and 1550 transitions. [2025-03-09 06:03:51,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:03:51,139 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 states have internal predecessors, (96), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 103 [2025-03-09 06:03:51,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:03:51,141 INFO L225 Difference]: With dead ends: 1137 [2025-03-09 06:03:51,141 INFO L226 Difference]: Without dead ends: 645 [2025-03-09 06:03:51,141 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-09 06:03:51,142 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 14 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1960 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:03:51,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1960 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:03:51,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-09 06:03:51,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 639. [2025-03-09 06:03:51,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 626 states have (on average 1.3706070287539935) internal successors, (858), 631 states have internal predecessors, (858), 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-09 06:03:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 870 transitions. [2025-03-09 06:03:51,154 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 870 transitions. Word has length 103 [2025-03-09 06:03:51,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:03:51,154 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 870 transitions. [2025-03-09 06:03:51,155 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-09 06:03:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 870 transitions. [2025-03-09 06:03:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 06:03:51,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:03:51,156 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:03:51,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:03:51,158 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-09 06:03:51,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:03:51,158 INFO L85 PathProgramCache]: Analyzing trace with hash -300627340, now seen corresponding path program 1 times [2025-03-09 06:03:51,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:03:51,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907234179] [2025-03-09 06:03:51,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:51,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:03:51,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 06:03:51,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 06:03:51,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:51,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:51,427 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-09 06:03:51,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:03:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907234179] [2025-03-09 06:03:51,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907234179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:03:51,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171594329] [2025-03-09 06:03:51,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:03:51,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:03:51,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:03:51,434 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:03:51,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:03:51,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 06:03:51,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 06:03:51,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:03:51,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:03:51,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:03:51,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:14,613 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-09 06:04:14,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:14,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171594329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:14,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:14,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-09 06:04:14,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010730988] [2025-03-09 06:04:14,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:14,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:04:14,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:14,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:04:14,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:04:14,620 INFO L87 Difference]: Start difference. First operand 639 states and 870 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-09 06:04:19,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-09 06:04:21,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-09 06:04:25,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-09 06:04:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:26,069 INFO L93 Difference]: Finished difference Result 1159 states and 1580 transitions. [2025-03-09 06:04:26,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:04:26,069 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 7 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 104 [2025-03-09 06:04:26,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:26,072 INFO L225 Difference]: With dead ends: 1159 [2025-03-09 06:04:26,072 INFO L226 Difference]: Without dead ends: 645 [2025-03-09 06:04:26,072 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:04:26,073 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 12 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1967 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:26,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1967 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 875 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2025-03-09 06:04:26,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-09 06:04:26,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 621. [2025-03-09 06:04:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 608 states have (on average 1.3667763157894737) internal successors, (831), 613 states have internal predecessors, (831), 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-09 06:04:26,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 843 transitions. [2025-03-09 06:04:26,086 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 843 transitions. Word has length 104 [2025-03-09 06:04:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:26,087 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 843 transitions. [2025-03-09 06:04:26,087 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-09 06:04:26,087 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 843 transitions. [2025-03-09 06:04:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 06:04:26,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:26,088 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:26,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 06:04:26,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:26,288 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-09 06:04:26,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:26,289 INFO L85 PathProgramCache]: Analyzing trace with hash 687749369, now seen corresponding path program 1 times [2025-03-09 06:04:26,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:26,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138597459] [2025-03-09 06:04:26,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:26,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:26,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:04:26,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:04:26,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:26,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:26,559 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-09 06:04:26,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:26,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138597459] [2025-03-09 06:04:26,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138597459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:26,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:04:26,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 06:04:26,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110997728] [2025-03-09 06:04:26,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:26,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:04:26,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:26,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:04:26,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:04:26,561 INFO L87 Difference]: Start difference. First operand 621 states and 843 transitions. Second operand has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:27,130 INFO L93 Difference]: Finished difference Result 1128 states and 1529 transitions. [2025-03-09 06:04:27,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:04:27,131 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-03-09 06:04:27,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:27,133 INFO L225 Difference]: With dead ends: 1128 [2025-03-09 06:04:27,133 INFO L226 Difference]: Without dead ends: 647 [2025-03-09 06:04:27,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:04:27,135 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 20 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2379 SdHoareTripleChecker+Invalid, 944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:27,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2379 Invalid, 944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:04:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-09 06:04:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 635. [2025-03-09 06:04:27,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 622 states have (on average 1.364951768488746) internal successors, (849), 627 states have internal predecessors, (849), 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-09 06:04:27,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 861 transitions. [2025-03-09 06:04:27,150 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 861 transitions. Word has length 105 [2025-03-09 06:04:27,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:27,150 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 861 transitions. [2025-03-09 06:04:27,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.88888888888889) internal successors, (98), 9 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:27,150 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 861 transitions. [2025-03-09 06:04:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 06:04:27,151 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:27,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:27,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:04:27,151 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-09 06:04:27,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash 2093948912, now seen corresponding path program 1 times [2025-03-09 06:04:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:27,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117719677] [2025-03-09 06:04:27,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:27,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:04:27,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:04:27,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:27,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:27,351 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-09 06:04:27,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:27,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117719677] [2025-03-09 06:04:27,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117719677] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:27,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226603486] [2025-03-09 06:04:27,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:27,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:27,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:27,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:27,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:04:27,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:04:27,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:04:27,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:27,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:27,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:04:27,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:27,758 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-09 06:04:27,759 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226603486] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:27,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:27,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-09 06:04:27,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14142579] [2025-03-09 06:04:27,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:27,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:04:27,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:27,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:04:27,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:04:27,761 INFO L87 Difference]: Start difference. First operand 635 states and 861 transitions. Second operand has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:28,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:28,494 INFO L93 Difference]: Finished difference Result 1153 states and 1560 transitions. [2025-03-09 06:04:28,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:04:28,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 105 [2025-03-09 06:04:28,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:28,497 INFO L225 Difference]: With dead ends: 1153 [2025-03-09 06:04:28,497 INFO L226 Difference]: Without dead ends: 665 [2025-03-09 06:04:28,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:04:28,498 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 40 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 2366 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1000 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:28,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 2366 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1000 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 06:04:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-09 06:04:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 645. [2025-03-09 06:04:28,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 632 states have (on average 1.3623417721518987) internal successors, (861), 637 states have internal predecessors, (861), 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-09 06:04:28,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 873 transitions. [2025-03-09 06:04:28,508 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 873 transitions. Word has length 105 [2025-03-09 06:04:28,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:28,509 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 873 transitions. [2025-03-09 06:04:28,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.25) internal successors, (98), 8 states have internal predecessors, (98), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 873 transitions. [2025-03-09 06:04:28,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 06:04:28,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:28,510 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:28,517 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-09 06:04:28,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 06:04:28,710 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:28,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:28,711 INFO L85 PathProgramCache]: Analyzing trace with hash 423112676, now seen corresponding path program 1 times [2025-03-09 06:04:28,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:28,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046310499] [2025-03-09 06:04:28,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:28,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:28,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 06:04:28,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 06:04:28,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:28,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:28,979 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-09 06:04:28,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:28,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046310499] [2025-03-09 06:04:28,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046310499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:28,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:04:28,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 06:04:28,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085996945] [2025-03-09 06:04:28,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:28,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:04:28,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:28,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:04:28,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:04:28,981 INFO L87 Difference]: Start difference. First operand 645 states and 873 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:29,744 INFO L93 Difference]: Finished difference Result 1161 states and 1572 transitions. [2025-03-09 06:04:29,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:04:29,745 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 106 [2025-03-09 06:04:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:29,747 INFO L225 Difference]: With dead ends: 1161 [2025-03-09 06:04:29,747 INFO L226 Difference]: Without dead ends: 663 [2025-03-09 06:04:29,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:04:29,748 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 23 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2951 SdHoareTripleChecker+Invalid, 1396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:29,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2951 Invalid, 1396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1395 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-09 06:04:29,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-03-09 06:04:29,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 651. [2025-03-09 06:04:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 638 states have (on average 1.358934169278997) internal successors, (867), 643 states have internal predecessors, (867), 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-09 06:04:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 879 transitions. [2025-03-09 06:04:29,758 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 879 transitions. Word has length 106 [2025-03-09 06:04:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:29,758 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 879 transitions. [2025-03-09 06:04:29,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 10 states have internal predecessors, (99), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:29,759 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 879 transitions. [2025-03-09 06:04:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 06:04:29,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:29,759 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:29,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:04:29,763 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:29,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:29,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1065625549, now seen corresponding path program 1 times [2025-03-09 06:04:29,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:29,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215273375] [2025-03-09 06:04:29,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:29,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:29,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 06:04:29,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 06:04:29,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:29,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:29,978 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-09 06:04:29,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215273375] [2025-03-09 06:04:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215273375] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [113999749] [2025-03-09 06:04:29,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:29,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:29,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:29,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:29,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:04:30,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 06:04:30,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 06:04:30,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:30,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:30,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:04:30,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:30,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:04:30,343 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-09 06:04:30,343 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:30,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [113999749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:30,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:30,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2025-03-09 06:04:30,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170354506] [2025-03-09 06:04:30,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:30,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:04:30,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:30,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:04:30,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:04:30,345 INFO L87 Difference]: Start difference. First operand 651 states and 879 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 06:04:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:30,531 INFO L93 Difference]: Finished difference Result 1115 states and 1505 transitions. [2025-03-09 06:04:30,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:04:30,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 106 [2025-03-09 06:04:30,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:30,535 INFO L225 Difference]: With dead ends: 1115 [2025-03-09 06:04:30,536 INFO L226 Difference]: Without dead ends: 654 [2025-03-09 06:04:30,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 104 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-09 06:04:30,536 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 266 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 2109 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:30,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 2109 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 06:04:30,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-09 06:04:30,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2025-03-09 06:04:30,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 640 states have (on average 1.359375) internal successors, (870), 646 states have internal predecessors, (870), 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-09 06:04:30,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 884 transitions. [2025-03-09 06:04:30,549 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 884 transitions. Word has length 106 [2025-03-09 06:04:30,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:30,549 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 884 transitions. [2025-03-09 06:04:30,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 6 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-09 06:04:30,550 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 884 transitions. [2025-03-09 06:04:30,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 06:04:30,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:30,550 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:30,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:04:30,751 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,SelfDestructingSolverStorable17 [2025-03-09 06:04:30,751 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:30,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:30,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2006427921, now seen corresponding path program 1 times [2025-03-09 06:04:30,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:30,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153815925] [2025-03-09 06:04:30,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:30,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:30,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:04:30,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:04:30,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:30,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:31,366 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-09 06:04:31,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:31,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153815925] [2025-03-09 06:04:31,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153815925] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:31,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [419843164] [2025-03-09 06:04:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:31,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:31,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:31,373 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:31,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:04:31,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:04:32,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:04:32,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:32,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:32,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:04:32,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:32,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-09 06:04:32,679 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-09 06:04:32,679 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:04:33,133 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-09 06:04:33,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [419843164] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:04:33,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:04:33,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 17 [2025-03-09 06:04:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552727509] [2025-03-09 06:04:33,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:04:33,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 06:04:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:33,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 06:04:33,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-09 06:04:33,139 INFO L87 Difference]: Start difference. First operand 654 states and 884 transitions. Second operand has 17 states, 17 states have (on average 12.235294117647058) internal successors, (208), 17 states have internal predecessors, (208), 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-09 06:04:38,524 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-09 06:04:42,540 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-09 06:04:46,564 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-09 06:04:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:46,778 INFO L93 Difference]: Finished difference Result 1352 states and 1823 transitions. [2025-03-09 06:04:46,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:04:46,779 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 12.235294117647058) internal successors, (208), 17 states have internal predecessors, (208), 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 108 [2025-03-09 06:04:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:46,786 INFO L225 Difference]: With dead ends: 1352 [2025-03-09 06:04:46,790 INFO L226 Difference]: Without dead ends: 886 [2025-03-09 06:04:46,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:04:46,792 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 523 mSDsluCounter, 4729 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 526 SdHoareTripleChecker+Valid, 5215 SdHoareTripleChecker+Invalid, 818 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:46,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 5215 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 801 Invalid, 3 Unknown, 0 Unchecked, 13.1s Time] [2025-03-09 06:04:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-09 06:04:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 738. [2025-03-09 06:04:46,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 719 states have (on average 1.3630041724617525) internal successors, (980), 725 states have internal predecessors, (980), 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-09 06:04:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1001 transitions. [2025-03-09 06:04:46,846 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1001 transitions. Word has length 108 [2025-03-09 06:04:46,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:46,847 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1001 transitions. [2025-03-09 06:04:46,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 12.235294117647058) internal successors, (208), 17 states have internal predecessors, (208), 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-09 06:04:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1001 transitions. [2025-03-09 06:04:46,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 06:04:46,851 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:46,852 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:46,875 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-09 06:04:47,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:47,053 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:47,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:47,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1550802995, now seen corresponding path program 2 times [2025-03-09 06:04:47,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:47,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324770851] [2025-03-09 06:04:47,058 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:04:47,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:47,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 06:04:47,398 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 06:04:47,402 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:04:47,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:47,760 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-09 06:04:47,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324770851] [2025-03-09 06:04:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324770851] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015733005] [2025-03-09 06:04:47,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:04:47,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:47,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:47,769 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:47,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 06:04:48,205 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 06:04:48,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 112 statements. [2025-03-09 06:04:48,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:04:48,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:48,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:04:48,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:48,248 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-09 06:04:48,260 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-09 06:04:48,260 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:48,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015733005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:48,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:48,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-09 06:04:48,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138933493] [2025-03-09 06:04:48,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:48,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:04:48,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:48,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:04:48,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:04:48,266 INFO L87 Difference]: Start difference. First operand 738 states and 1001 transitions. Second operand has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:48,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:48,404 INFO L93 Difference]: Finished difference Result 738 states and 1001 transitions. [2025-03-09 06:04:48,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:04:48,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 112 [2025-03-09 06:04:48,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:48,411 INFO L225 Difference]: With dead ends: 738 [2025-03-09 06:04:48,412 INFO L226 Difference]: Without dead ends: 737 [2025-03-09 06:04:48,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:04:48,418 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 1 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:48,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 860 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 06:04:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-09 06:04:48,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2025-03-09 06:04:48,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 737 states, 719 states have (on average 1.3616133518776077) internal successors, (979), 724 states have internal predecessors, (979), 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-09 06:04:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1000 transitions. [2025-03-09 06:04:48,494 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1000 transitions. Word has length 112 [2025-03-09 06:04:48,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:48,498 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1000 transitions. [2025-03-09 06:04:48,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 48.5) internal successors, (97), 3 states have internal predecessors, (97), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1000 transitions. [2025-03-09 06:04:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 06:04:48,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:48,499 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:48,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-09 06:04:48,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:48,701 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:48,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:48,701 INFO L85 PathProgramCache]: Analyzing trace with hash -830251945, now seen corresponding path program 1 times [2025-03-09 06:04:48,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:48,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661274620] [2025-03-09 06:04:48,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:48,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:48,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:04:48,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:04:48,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:48,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:49,288 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-09 06:04:49,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:49,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661274620] [2025-03-09 06:04:49,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661274620] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:49,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199812782] [2025-03-09 06:04:49,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:49,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:49,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:49,295 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:49,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-09 06:04:49,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:04:50,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:04:50,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:50,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:50,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:04:50,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:51,206 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 06:04:51,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:51,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199812782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:51,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:51,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-09 06:04:51,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880848534] [2025-03-09 06:04:51,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:51,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:04:51,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:51,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:04:51,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:04:51,212 INFO L87 Difference]: Start difference. First operand 737 states and 1000 transitions. Second operand has 10 states, 10 states have (on average 10.1) internal successors, (101), 10 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:53,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:53,237 INFO L93 Difference]: Finished difference Result 1348 states and 1834 transitions. [2025-03-09 06:04:53,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:04:53,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 10 states have internal predecessors, (101), 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 113 [2025-03-09 06:04:53,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:53,244 INFO L225 Difference]: With dead ends: 1348 [2025-03-09 06:04:53,244 INFO L226 Difference]: Without dead ends: 761 [2025-03-09 06:04:53,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:04:53,249 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 17 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:53,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2946 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-09 06:04:53,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-09 06:04:53,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 751. [2025-03-09 06:04:53,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 751 states, 733 states have (on average 1.360163710777626) internal successors, (997), 738 states have internal predecessors, (997), 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-09 06:04:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1018 transitions. [2025-03-09 06:04:53,288 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1018 transitions. Word has length 113 [2025-03-09 06:04:53,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:53,288 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1018 transitions. [2025-03-09 06:04:53,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.1) internal successors, (101), 10 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:53,289 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1018 transitions. [2025-03-09 06:04:53,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 06:04:53,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:53,290 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:53,326 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 06:04:53,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:53,491 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:53,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:53,493 INFO L85 PathProgramCache]: Analyzing trace with hash 539602359, now seen corresponding path program 1 times [2025-03-09 06:04:53,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:53,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809285234] [2025-03-09 06:04:53,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:53,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:53,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:04:53,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:04:53,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:53,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:54,120 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-09 06:04:54,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:54,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809285234] [2025-03-09 06:04:54,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809285234] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:54,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950956301] [2025-03-09 06:04:54,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:54,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:54,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:54,128 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:54,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-09 06:04:54,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:04:54,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:04:54,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:54,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:54,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:04:54,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 06:04:54,928 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:54,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950956301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:54,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:54,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-09 06:04:54,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069264195] [2025-03-09 06:04:54,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:54,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:04:54,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:54,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:04:54,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:04:54,933 INFO L87 Difference]: Start difference. First operand 751 states and 1018 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:55,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:55,498 INFO L93 Difference]: Finished difference Result 1368 states and 1858 transitions. [2025-03-09 06:04:55,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:04:55,500 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 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 113 [2025-03-09 06:04:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:55,503 INFO L225 Difference]: With dead ends: 1368 [2025-03-09 06:04:55,506 INFO L226 Difference]: Without dead ends: 779 [2025-03-09 06:04:55,508 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:04:55,513 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 39 mSDsluCounter, 1621 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 2033 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:55,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 2033 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:04:55,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-09 06:04:55,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 765. [2025-03-09 06:04:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 747 states have (on average 1.3614457831325302) internal successors, (1017), 752 states have internal predecessors, (1017), 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-09 06:04:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1038 transitions. [2025-03-09 06:04:55,559 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1038 transitions. Word has length 113 [2025-03-09 06:04:55,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:55,559 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1038 transitions. [2025-03-09 06:04:55,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:55,559 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1038 transitions. [2025-03-09 06:04:55,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 06:04:55,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:55,564 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:55,581 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-09 06:04:55,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-09 06:04:55,765 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:55,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:55,769 INFO L85 PathProgramCache]: Analyzing trace with hash -1666113293, now seen corresponding path program 1 times [2025-03-09 06:04:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:55,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899857683] [2025-03-09 06:04:55,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:55,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:55,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:04:55,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:04:55,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:55,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:56,530 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-09 06:04:56,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:56,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899857683] [2025-03-09 06:04:56,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899857683] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:56,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915331140] [2025-03-09 06:04:56,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:56,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:56,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:56,542 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:56,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-09 06:04:56,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:04:57,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:04:57,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:57,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:57,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:04:57,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:57,329 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-09 06:04:57,329 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:04:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915331140] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:04:57,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:04:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-09 06:04:57,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496053169] [2025-03-09 06:04:57,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:04:57,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:04:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:04:57,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:04:57,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:04:57,330 INFO L87 Difference]: Start difference. First operand 765 states and 1038 transitions. Second operand has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:58,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:04:58,115 INFO L93 Difference]: Finished difference Result 1376 states and 1870 transitions. [2025-03-09 06:04:58,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:04:58,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 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 113 [2025-03-09 06:04:58,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:04:58,127 INFO L225 Difference]: With dead ends: 1376 [2025-03-09 06:04:58,127 INFO L226 Difference]: Without dead ends: 775 [2025-03-09 06:04:58,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:04:58,131 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 10 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 878 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-09 06:04:58,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 1961 Invalid, 878 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-09 06:04:58,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-09 06:04:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 765. [2025-03-09 06:04:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 747 states have (on average 1.3614457831325302) internal successors, (1017), 752 states have internal predecessors, (1017), 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-09 06:04:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1038 transitions. [2025-03-09 06:04:58,175 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1038 transitions. Word has length 113 [2025-03-09 06:04:58,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:04:58,177 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1038 transitions. [2025-03-09 06:04:58,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.428571428571429) internal successors, (101), 7 states have internal predecessors, (101), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 06:04:58,177 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1038 transitions. [2025-03-09 06:04:58,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-09 06:04:58,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:04:58,182 INFO L218 NwaCegarLoop]: trace histogram [6, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:04:58,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-09 06:04:58,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-03-09 06:04:58,383 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:04:58,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:04:58,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2080430933, now seen corresponding path program 1 times [2025-03-09 06:04:58,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:04:58,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130809894] [2025-03-09 06:04:58,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:58,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:04:58,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-09 06:04:58,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 06:04:58,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:58,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:59,199 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-09 06:04:59,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:04:59,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130809894] [2025-03-09 06:04:59,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130809894] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:04:59,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586147722] [2025-03-09 06:04:59,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:04:59,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:04:59,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:04:59,209 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:04:59,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-09 06:04:59,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-09 06:04:59,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 06:04:59,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:04:59,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:04:59,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:04:59,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:04:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-09 06:04:59,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:05:04,151 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 9 refuted. 1 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:05:04,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586147722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:05:04,151 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:05:04,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 19 [2025-03-09 06:05:04,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390933300] [2025-03-09 06:05:04,152 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:05:04,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:05:04,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:05:04,152 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:05:04,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=245, Unknown=1, NotChecked=0, Total=342 [2025-03-09 06:05:04,153 INFO L87 Difference]: Start difference. First operand 765 states and 1038 transitions. Second operand has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 06:05:04,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:05:04,843 INFO L93 Difference]: Finished difference Result 1261 states and 1713 transitions. [2025-03-09 06:05:04,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:05:04,845 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 114 [2025-03-09 06:05:04,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:05:04,847 INFO L225 Difference]: With dead ends: 1261 [2025-03-09 06:05:04,848 INFO L226 Difference]: Without dead ends: 566 [2025-03-09 06:05:04,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=237, Invalid=518, Unknown=1, NotChecked=0, Total=756 [2025-03-09 06:05:04,855 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 31 mSDsluCounter, 3145 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 3498 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:05:04,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 3498 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-09 06:05:04,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-09 06:05:04,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 556. [2025-03-09 06:05:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 539 states have (on average 1.3320964749536177) internal successors, (718), 545 states have internal predecessors, (718), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-09 06:05:04,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 732 transitions. [2025-03-09 06:05:04,887 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 732 transitions. Word has length 114 [2025-03-09 06:05:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:05:04,887 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 732 transitions. [2025-03-09 06:05:04,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.631578947368421) internal successors, (126), 19 states have internal predecessors, (126), 2 states have call successors, (3), 1 states have call predecessors, (3), 4 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-09 06:05:04,888 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 732 transitions. [2025-03-09 06:05:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 06:05:04,888 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:05:04,888 INFO L218 NwaCegarLoop]: trace histogram [15, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:05:04,907 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-09 06:05:05,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-09 06:05:05,092 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:05:05,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:05:05,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1257341647, now seen corresponding path program 2 times [2025-03-09 06:05:05,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:05:05,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137716966] [2025-03-09 06:05:05,093 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:05:05,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:05:05,223 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-09 06:05:05,421 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 06:05:05,422 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:05:05,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:05:06,036 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 6 proven. 83 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 06:05:06,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:05:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137716966] [2025-03-09 06:05:06,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137716966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:05:06,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740150852] [2025-03-09 06:05:06,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:05:06,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:05:06,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:05:06,043 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:05:06,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-09 06:05:06,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-09 06:05:07,730 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 06:05:07,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:05:07,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:05:07,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:05:07,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:05:07,822 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 75 proven. 15 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-09 06:05:07,822 INFO L312 TraceCheckSpWp]: Computing backward predicates...