./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_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_SFH_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:16:37,016 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:16:37,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:16:37,075 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:16:37,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:16:37,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:16:37,098 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:16:37,098 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:16:37,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:16:37,098 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:16:37,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:16:37,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:16:37,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:16:37,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:16:37,100 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:16:37,100 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:16:37,100 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:16:37,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:16:37,102 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:16:37,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:16:37,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:16:37,103 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:16:37,103 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:16:37,356 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:16:37,365 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:16:37,367 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:16:37,368 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:16:37,368 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:16:37,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i [2025-03-09 06:16:38,548 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f45c1647c/ae801e5436004d5b98ed305119533ffa/FLAG82c2d7b65 [2025-03-09 06:16:38,846 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:16:38,846 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_nondet_test3-1.i [2025-03-09 06:16:38,858 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f45c1647c/ae801e5436004d5b98ed305119533ffa/FLAG82c2d7b65 [2025-03-09 06:16:39,118 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f45c1647c/ae801e5436004d5b98ed305119533ffa [2025-03-09 06:16:39,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:16:39,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:16:39,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:16:39,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:16:39,125 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:16:39,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,127 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755a91b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39, skipping insertion in model container [2025-03-09 06:16:39,127 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,164 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:16:39,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:16:39,574 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:16:39,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:16:39,676 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:16:39,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39 WrapperNode [2025-03-09 06:16:39,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:16:39,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:16:39,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:16:39,677 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:16:39,681 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:16:39" (1/1) ... [2025-03-09 06:16:39,696 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:16:39" (1/1) ... [2025-03-09 06:16:39,734 INFO L138 Inliner]: procedures = 177, calls = 274, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1397 [2025-03-09 06:16:39,735 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:16:39,735 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:16:39,735 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:16:39,735 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:16:39,746 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,746 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,814 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:16:39,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,848 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,869 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:16:39,870 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:16:39,870 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:16:39,870 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:16:39,871 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (1/1) ... [2025-03-09 06:16:39,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:16:39,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:16:39,899 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:16:39,903 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:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-03-09 06:16:39,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-09 06:16:39,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-09 06:16:39,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-09 06:16:39,919 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 06:16:39,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:16:39,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:16:39,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:16:40,095 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:16:40,096 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:16:41,153 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:16:41,255 INFO L? ?]: Removed 322 outVars from TransFormulas that were not future-live. [2025-03-09 06:16:41,256 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:16:41,302 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:16:41,304 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-09 06:16:41,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:16:41 BoogieIcfgContainer [2025-03-09 06:16:41,304 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:16:41,306 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:16:41,306 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:16:41,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:16:41,311 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:16:39" (1/3) ... [2025-03-09 06:16:41,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d98efeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:16:41, skipping insertion in model container [2025-03-09 06:16:41,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:16:39" (2/3) ... [2025-03-09 06:16:41,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d98efeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:16:41, skipping insertion in model container [2025-03-09 06:16:41,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:16:41" (3/3) ... [2025-03-09 06:16:41,314 INFO L128 eAbstractionObserver]: Analyzing ICFG uthash_SFH_nondet_test3-1.i [2025-03-09 06:16:41,326 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:16:41,327 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG uthash_SFH_nondet_test3-1.i that has 5 procedures, 415 locations, 1 initial locations, 36 loop locations, and 6 error locations. [2025-03-09 06:16:41,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:16:41,385 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;@77102f91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:16:41,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-03-09 06:16:41,389 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:16:41,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 06:16:41,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:41,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:16:41,393 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:16:41,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1991908556, now seen corresponding path program 1 times [2025-03-09 06:16:41,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:41,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106341737] [2025-03-09 06:16:41,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:41,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:41,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:16:41,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:16:41,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:41,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:41,538 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:16:41,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:41,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106341737] [2025-03-09 06:16:41,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106341737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:41,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:41,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:16:41,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574255373] [2025-03-09 06:16:41,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:41,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 06:16:41,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:41,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 06:16:41,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 06:16:41,562 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:16:41,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:41,663 INFO L93 Difference]: Finished difference Result 810 states and 1293 transitions. [2025-03-09 06:16:41,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 06:16:41,665 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:16:41,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:41,672 INFO L225 Difference]: With dead ends: 810 [2025-03-09 06:16:41,673 INFO L226 Difference]: Without dead ends: 398 [2025-03-09 06:16:41,677 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:16:41,681 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:16:41,683 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:16:41,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-03-09 06:16:41,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2025-03-09 06:16:41,731 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:16:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 572 transitions. [2025-03-09 06:16:41,739 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 572 transitions. Word has length 8 [2025-03-09 06:16:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:41,739 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 572 transitions. [2025-03-09 06:16:41,739 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:16:41,739 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 572 transitions. [2025-03-09 06:16:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 06:16:41,740 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:41,740 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:16:41,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:16:41,741 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:16:41,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1991907595, now seen corresponding path program 1 times [2025-03-09 06:16:41,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:41,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946096876] [2025-03-09 06:16:41,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:41,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:16:41,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:16:41,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:41,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-09 06:16:41,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1741145313] [2025-03-09 06:16:41,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:41,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:16:41,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:16:41,785 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:16:41,787 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:16:41,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:16:41,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:16:41,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:41,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:41,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-09 06:16:41,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:16:41,945 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:16:41,980 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:16:41,980 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:16:41,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:41,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946096876] [2025-03-09 06:16:41,981 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-09 06:16:41,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741145313] [2025-03-09 06:16:41,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741145313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:41,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:41,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:16:41,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499092637] [2025-03-09 06:16:41,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:41,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:16:41,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:41,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:16:41,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:16:41,983 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:16:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:42,227 INFO L93 Difference]: Finished difference Result 785 states and 1134 transitions. [2025-03-09 06:16:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:16:42,227 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:16:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:42,231 INFO L225 Difference]: With dead ends: 785 [2025-03-09 06:16:42,231 INFO L226 Difference]: Without dead ends: 783 [2025-03-09 06:16:42,233 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:16:42,234 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 547 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2025-03-09 06:16:42,234 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.2s Time] [2025-03-09 06:16:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-09 06:16:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 404. [2025-03-09 06:16:42,264 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:16:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 579 transitions. [2025-03-09 06:16:42,268 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 579 transitions. Word has length 8 [2025-03-09 06:16:42,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:42,269 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 579 transitions. [2025-03-09 06:16:42,269 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:16:42,269 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 579 transitions. [2025-03-09 06:16:42,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 06:16:42,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:42,271 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:16:42,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:16:42,471 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:16:42,472 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:16:42,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:42,472 INFO L85 PathProgramCache]: Analyzing trace with hash -568921142, now seen corresponding path program 1 times [2025-03-09 06:16:42,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:42,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455515320] [2025-03-09 06:16:42,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:42,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:42,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 06:16:42,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 06:16:42,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:42,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:42,717 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:16:42,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:42,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455515320] [2025-03-09 06:16:42,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455515320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:42,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:42,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:16:42,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784400801] [2025-03-09 06:16:42,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:42,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:16:42,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:42,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:16:42,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:16:42,720 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:16:42,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:42,854 INFO L93 Difference]: Finished difference Result 552 states and 789 transitions. [2025-03-09 06:16:42,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:16:42,855 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:16:42,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:42,856 INFO L225 Difference]: With dead ends: 552 [2025-03-09 06:16:42,856 INFO L226 Difference]: Without dead ends: 362 [2025-03-09 06:16:42,857 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:16:42,857 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:16:42,858 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:16:42,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-09 06:16:42,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2025-03-09 06:16:42,864 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:16:42,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 502 transitions. [2025-03-09 06:16:42,866 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 502 transitions. Word has length 69 [2025-03-09 06:16:42,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:42,866 INFO L471 AbstractCegarLoop]: Abstraction has 362 states and 502 transitions. [2025-03-09 06:16:42,866 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:16:42,866 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 502 transitions. [2025-03-09 06:16:42,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 06:16:42,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:42,868 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:16:42,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:16:42,868 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:16:42,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:42,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1492127488, now seen corresponding path program 1 times [2025-03-09 06:16:42,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:42,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787788070] [2025-03-09 06:16:42,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:42,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:42,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 06:16:42,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 06:16:42,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:42,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:43,010 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:16:43,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:43,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787788070] [2025-03-09 06:16:43,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787788070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:43,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:43,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:16:43,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949555928] [2025-03-09 06:16:43,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:43,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:16:43,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:43,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:16:43,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:16:43,012 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:16:43,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:43,132 INFO L93 Difference]: Finished difference Result 504 states and 695 transitions. [2025-03-09 06:16:43,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:16:43,132 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:16:43,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:43,134 INFO L225 Difference]: With dead ends: 504 [2025-03-09 06:16:43,134 INFO L226 Difference]: Without dead ends: 356 [2025-03-09 06:16:43,135 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:16:43,135 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:16:43,138 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.1s Time] [2025-03-09 06:16:43,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2025-03-09 06:16:43,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2025-03-09 06:16:43,151 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:16:43,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 492 transitions. [2025-03-09 06:16:43,154 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 492 transitions. Word has length 69 [2025-03-09 06:16:43,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:43,154 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 492 transitions. [2025-03-09 06:16:43,154 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:16:43,154 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 492 transitions. [2025-03-09 06:16:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-09 06:16:43,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:43,158 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:16:43,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:16:43,158 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:16:43,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:43,158 INFO L85 PathProgramCache]: Analyzing trace with hash -701635836, now seen corresponding path program 1 times [2025-03-09 06:16:43,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:43,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645280273] [2025-03-09 06:16:43,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:43,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:43,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-09 06:16:43,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-09 06:16:43,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:43,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:43,256 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:16:43,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:43,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645280273] [2025-03-09 06:16:43,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645280273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:43,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:43,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:16:43,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250331957] [2025-03-09 06:16:43,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:43,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:16:43,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:43,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:16:43,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:16:43,258 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:16:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:43,336 INFO L93 Difference]: Finished difference Result 498 states and 681 transitions. [2025-03-09 06:16:43,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:16:43,337 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:16:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:43,339 INFO L225 Difference]: With dead ends: 498 [2025-03-09 06:16:43,339 INFO L226 Difference]: Without dead ends: 351 [2025-03-09 06:16:43,339 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:16:43,339 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:16:43,339 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:16:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-09 06:16:43,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-09 06:16:43,344 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:16:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 486 transitions. [2025-03-09 06:16:43,345 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 486 transitions. Word has length 69 [2025-03-09 06:16:43,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:43,345 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 486 transitions. [2025-03-09 06:16:43,346 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:16:43,346 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 486 transitions. [2025-03-09 06:16:43,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-09 06:16:43,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:43,347 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:16:43,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:16:43,347 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:16:43,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:43,351 INFO L85 PathProgramCache]: Analyzing trace with hash -508576809, now seen corresponding path program 1 times [2025-03-09 06:16:43,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:43,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776823518] [2025-03-09 06:16:43,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:43,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:43,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 06:16:43,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 06:16:43,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:43,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:43,452 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:16:43,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:43,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776823518] [2025-03-09 06:16:43,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776823518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:43,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:43,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:16:43,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640396642] [2025-03-09 06:16:43,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:43,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:16:43,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:43,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:16:43,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:16:43,454 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:16:43,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:43,524 INFO L93 Difference]: Finished difference Result 495 states and 677 transitions. [2025-03-09 06:16:43,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:16:43,524 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:16:43,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:43,526 INFO L225 Difference]: With dead ends: 495 [2025-03-09 06:16:43,527 INFO L226 Difference]: Without dead ends: 351 [2025-03-09 06:16:43,527 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:16:43,528 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:16:43,528 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:16:43,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2025-03-09 06:16:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2025-03-09 06:16:43,536 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:16:43,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 482 transitions. [2025-03-09 06:16:43,537 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 482 transitions. Word has length 70 [2025-03-09 06:16:43,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:43,538 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 482 transitions. [2025-03-09 06:16:43,539 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:16:43,539 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 482 transitions. [2025-03-09 06:16:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 06:16:43,540 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:43,540 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:16:43,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:16:43,540 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:16:43,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash 623327717, now seen corresponding path program 1 times [2025-03-09 06:16:43,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:43,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255863672] [2025-03-09 06:16:43,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:43,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:43,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:16:43,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:16:43,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:43,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:43,713 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:16:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255863672] [2025-03-09 06:16:43,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255863672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:43,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:43,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:16:43,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923384539] [2025-03-09 06:16:43,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:43,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:16:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:43,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:16:43,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:16:43,715 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:16:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:43,830 INFO L93 Difference]: Finished difference Result 696 states and 957 transitions. [2025-03-09 06:16:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:16:43,831 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:16:43,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:43,833 INFO L225 Difference]: With dead ends: 696 [2025-03-09 06:16:43,833 INFO L226 Difference]: Without dead ends: 354 [2025-03-09 06:16:43,833 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:16:43,834 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:16:43,834 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.1s Time] [2025-03-09 06:16:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-03-09 06:16:43,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 351. [2025-03-09 06:16:43,844 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:16:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 475 transitions. [2025-03-09 06:16:43,847 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 475 transitions. Word has length 80 [2025-03-09 06:16:43,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:43,848 INFO L471 AbstractCegarLoop]: Abstraction has 351 states and 475 transitions. [2025-03-09 06:16:43,848 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:16:43,848 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 475 transitions. [2025-03-09 06:16:43,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-09 06:16:43,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:43,849 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:16:43,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:16:43,850 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:16:43,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:43,852 INFO L85 PathProgramCache]: Analyzing trace with hash -762616002, now seen corresponding path program 1 times [2025-03-09 06:16:43,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:43,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813257550] [2025-03-09 06:16:43,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:43,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:43,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:16:43,905 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:16:43,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:43,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:44,009 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:16:44,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:44,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813257550] [2025-03-09 06:16:44,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813257550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:44,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:44,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:16:44,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050780194] [2025-03-09 06:16:44,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:44,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:16:44,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:44,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:16:44,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:16:44,012 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:16:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:44,152 INFO L93 Difference]: Finished difference Result 906 states and 1240 transitions. [2025-03-09 06:16:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:16:44,152 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:16:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:44,154 INFO L225 Difference]: With dead ends: 906 [2025-03-09 06:16:44,154 INFO L226 Difference]: Without dead ends: 484 [2025-03-09 06:16:44,155 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:16:44,155 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 249 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2025-03-09 06:16:44,155 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.1s Time] [2025-03-09 06:16:44,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2025-03-09 06:16:44,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 482. [2025-03-09 06:16:44,166 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:16:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 665 transitions. [2025-03-09 06:16:44,168 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 665 transitions. Word has length 80 [2025-03-09 06:16:44,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:44,168 INFO L471 AbstractCegarLoop]: Abstraction has 482 states and 665 transitions. [2025-03-09 06:16:44,168 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:16:44,168 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 665 transitions. [2025-03-09 06:16:44,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-09 06:16:44,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:44,169 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:16:44,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:16:44,169 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:16:44,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:44,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1886669036, now seen corresponding path program 1 times [2025-03-09 06:16:44,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:44,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810264163] [2025-03-09 06:16:44,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:44,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:44,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-09 06:16:44,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-09 06:16:44,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:44,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:44,512 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:16:44,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:44,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810264163] [2025-03-09 06:16:44,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810264163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:44,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:44,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:16:44,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046730683] [2025-03-09 06:16:44,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:44,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:16:44,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:44,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:16:44,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:16:44,514 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:16:44,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:44,651 INFO L93 Difference]: Finished difference Result 690 states and 936 transitions. [2025-03-09 06:16:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:16:44,651 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:16:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:44,654 INFO L225 Difference]: With dead ends: 690 [2025-03-09 06:16:44,654 INFO L226 Difference]: Without dead ends: 688 [2025-03-09 06:16:44,654 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:16:44,655 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:16:44,655 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:16:44,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2025-03-09 06:16:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 545. [2025-03-09 06:16:44,665 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:16:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 748 transitions. [2025-03-09 06:16:44,667 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 748 transitions. Word has length 95 [2025-03-09 06:16:44,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:44,667 INFO L471 AbstractCegarLoop]: Abstraction has 545 states and 748 transitions. [2025-03-09 06:16:44,668 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:16:44,668 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 748 transitions. [2025-03-09 06:16:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-09 06:16:44,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:44,668 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:16:44,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:16:44,669 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:16:44,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1857425891, now seen corresponding path program 1 times [2025-03-09 06:16:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904360660] [2025-03-09 06:16:44,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:44,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:16:44,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:16:44,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:44,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:44,990 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:16:44,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904360660] [2025-03-09 06:16:44,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904360660] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:16:44,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650486451] [2025-03-09 06:16:44,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:44,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:16:44,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:16:44,992 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:16:44,994 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:16:45,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-09 06:16:45,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-09 06:16:45,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:45,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:45,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-09 06:16:45,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:16:45,252 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:16:45,268 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:16:45,284 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:16:45,899 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:16:45,900 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:16:45,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650486451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:45,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:16:45,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4] total 13 [2025-03-09 06:16:45,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510449969] [2025-03-09 06:16:45,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:45,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:16:45,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:45,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:16:45,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-09 06:16:45,902 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:16:47,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:47,495 INFO L93 Difference]: Finished difference Result 1194 states and 1622 transitions. [2025-03-09 06:16:47,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:16:47,498 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:16:47,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:47,500 INFO L225 Difference]: With dead ends: 1194 [2025-03-09 06:16:47,500 INFO L226 Difference]: Without dead ends: 736 [2025-03-09 06:16:47,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2025-03-09 06:16:47,503 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 720 mSDsluCounter, 1905 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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, 1.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:16:47,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 2327 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1066 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-09 06:16:47,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-09 06:16:47,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 570. [2025-03-09 06:16:47,514 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:16:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 778 transitions. [2025-03-09 06:16:47,516 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 778 transitions. Word has length 101 [2025-03-09 06:16:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:47,516 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 778 transitions. [2025-03-09 06:16:47,516 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:16:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 778 transitions. [2025-03-09 06:16:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-09 06:16:47,517 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:47,517 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:16:47,524 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:16:47,721 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:16:47,721 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:16:47,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:47,721 INFO L85 PathProgramCache]: Analyzing trace with hash 850268527, now seen corresponding path program 1 times [2025-03-09 06:16:47,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:47,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055959832] [2025-03-09 06:16:47,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:47,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:47,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:16:47,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:16:47,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:47,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:48,072 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:16:48,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055959832] [2025-03-09 06:16:48,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055959832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:16:48,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1235448695] [2025-03-09 06:16:48,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:48,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:16:48,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:16:48,075 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:16:48,076 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:16:48,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-09 06:16:48,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-09 06:16:48,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:48,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:48,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-09 06:16:48,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:16:48,599 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:16:48,613 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:16:48,625 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:16:49,212 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:16:49,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:16:49,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1235448695] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:49,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:16:49,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [4] total 14 [2025-03-09 06:16:49,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690837102] [2025-03-09 06:16:49,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:49,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:16:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:49,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:16:49,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:16:49,214 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:16:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:50,548 INFO L93 Difference]: Finished difference Result 1241 states and 1685 transitions. [2025-03-09 06:16:50,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:16:50,548 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:16:50,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:50,551 INFO L225 Difference]: With dead ends: 1241 [2025-03-09 06:16:50,551 INFO L226 Difference]: Without dead ends: 788 [2025-03-09 06:16:50,552 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2025-03-09 06:16:50,553 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 803 mSDsluCounter, 1536 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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.0s IncrementalHoareTripleChecker+Time [2025-03-09 06:16:50,553 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.0s Time] [2025-03-09 06:16:50,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2025-03-09 06:16:50,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 605. [2025-03-09 06:16:50,566 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:16:50,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 823 transitions. [2025-03-09 06:16:50,568 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 823 transitions. Word has length 102 [2025-03-09 06:16:50,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:50,569 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 823 transitions. [2025-03-09 06:16:50,569 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:16:50,569 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 823 transitions. [2025-03-09 06:16:50,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 06:16:50,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:50,571 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:16:50,584 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:16:50,771 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:16:50,771 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:16:50,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:50,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1604152320, now seen corresponding path program 1 times [2025-03-09 06:16:50,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:50,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277965826] [2025-03-09 06:16:50,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:50,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:50,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 06:16:50,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:16:50,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:50,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:51,046 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:16:51,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:51,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277965826] [2025-03-09 06:16:51,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277965826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:51,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:51,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:16:51,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835599986] [2025-03-09 06:16:51,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:51,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:16:51,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:51,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:16:51,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:16:51,048 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:16:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:51,454 INFO L93 Difference]: Finished difference Result 1112 states and 1515 transitions. [2025-03-09 06:16:51,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:16:51,454 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:16:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:51,456 INFO L225 Difference]: With dead ends: 1112 [2025-03-09 06:16:51,456 INFO L226 Difference]: Without dead ends: 627 [2025-03-09 06:16:51,457 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:16:51,458 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 9 mSDsluCounter, 1232 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:16:51,458 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.4s Time] [2025-03-09 06:16:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2025-03-09 06:16:51,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 623. [2025-03-09 06:16:51,470 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:16:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 848 transitions. [2025-03-09 06:16:51,473 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 848 transitions. Word has length 103 [2025-03-09 06:16:51,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:51,473 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 848 transitions. [2025-03-09 06:16:51,473 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:16:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 848 transitions. [2025-03-09 06:16:51,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-09 06:16:51,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:51,474 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:16:51,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:16:51,474 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:16:51,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:51,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1202592956, now seen corresponding path program 1 times [2025-03-09 06:16:51,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:51,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807414829] [2025-03-09 06:16:51,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:51,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:51,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-09 06:16:51,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-09 06:16:51,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:51,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:51,698 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:16:51,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:51,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807414829] [2025-03-09 06:16:51,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807414829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:16:51,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:16:51,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:16:51,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153435324] [2025-03-09 06:16:51,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:16:51,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:16:51,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:16:51,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:16:51,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:16:51,700 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:16:52,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:16:52,166 INFO L93 Difference]: Finished difference Result 1137 states and 1550 transitions. [2025-03-09 06:16:52,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:16:52,166 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:16:52,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:16:52,168 INFO L225 Difference]: With dead ends: 1137 [2025-03-09 06:16:52,168 INFO L226 Difference]: Without dead ends: 645 [2025-03-09 06:16:52,169 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:16:52,170 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.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:16:52,170 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.4s Time] [2025-03-09 06:16:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-09 06:16:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 639. [2025-03-09 06:16:52,182 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:16:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 870 transitions. [2025-03-09 06:16:52,183 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 870 transitions. Word has length 103 [2025-03-09 06:16:52,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:16:52,183 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 870 transitions. [2025-03-09 06:16:52,184 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:16:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 870 transitions. [2025-03-09 06:16:52,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-09 06:16:52,185 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:16:52,185 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:16:52,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:16:52,186 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:16:52,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:16:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash -300627340, now seen corresponding path program 1 times [2025-03-09 06:16:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:16:52,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516681728] [2025-03-09 06:16:52,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:52,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:16:52,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 06:16:52,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 06:16:52,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:52,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:52,467 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:16:52,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:16:52,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516681728] [2025-03-09 06:16:52,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516681728] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:16:52,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682648545] [2025-03-09 06:16:52,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:16:52,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:16:52,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:16:52,470 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:16:52,481 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:16:52,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-09 06:16:52,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-09 06:16:52,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:16:52,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:16:52,788 INFO L256 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:16:52,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:07,310 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:17:07,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:17:07,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682648545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:17:07,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:17:07,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4] total 9 [2025-03-09 06:17:07,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852124390] [2025-03-09 06:17:07,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:17:07,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:17:07,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:07,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:17:07,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:17:07,312 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:17:11,778 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:17:16,482 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:17:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:16,826 INFO L93 Difference]: Finished difference Result 1159 states and 1580 transitions. [2025-03-09 06:17:16,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:17:16,826 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:17:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:16,828 INFO L225 Difference]: With dead ends: 1159 [2025-03-09 06:17:16,828 INFO L226 Difference]: Without dead ends: 645 [2025-03-09 06:17:16,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:17:16,830 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 12 mSDsluCounter, 1544 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 2 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s 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, 9.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:17:16,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1967 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 875 Invalid, 2 Unknown, 0 Unchecked, 9.5s Time] [2025-03-09 06:17:16,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2025-03-09 06:17:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 621. [2025-03-09 06:17:16,843 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:17:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 843 transitions. [2025-03-09 06:17:16,844 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 843 transitions. Word has length 104 [2025-03-09 06:17:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:16,844 INFO L471 AbstractCegarLoop]: Abstraction has 621 states and 843 transitions. [2025-03-09 06:17:16,845 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:17:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 843 transitions. [2025-03-09 06:17:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 06:17:16,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:16,846 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:17:16,854 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:17:17,046 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:17:17,046 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:17:17,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:17,047 INFO L85 PathProgramCache]: Analyzing trace with hash 687749369, now seen corresponding path program 1 times [2025-03-09 06:17:17,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:17,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880895804] [2025-03-09 06:17:17,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:17,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:17,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:17:17,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:17:17,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:17,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:17,322 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:17:17,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:17,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880895804] [2025-03-09 06:17:17,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880895804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:17:17,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:17:17,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-09 06:17:17,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129725078] [2025-03-09 06:17:17,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:17:17,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:17:17,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:17,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:17:17,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:17:17,324 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:17:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:17,905 INFO L93 Difference]: Finished difference Result 1128 states and 1529 transitions. [2025-03-09 06:17:17,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:17:17,906 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:17:17,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:17,908 INFO L225 Difference]: With dead ends: 1128 [2025-03-09 06:17:17,908 INFO L226 Difference]: Without dead ends: 647 [2025-03-09 06:17:17,909 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:17:17,909 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.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:17:17,909 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.6s Time] [2025-03-09 06:17:17,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2025-03-09 06:17:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 635. [2025-03-09 06:17:17,922 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:17:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 861 transitions. [2025-03-09 06:17:17,924 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 861 transitions. Word has length 105 [2025-03-09 06:17:17,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:17,924 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 861 transitions. [2025-03-09 06:17:17,924 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:17:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 861 transitions. [2025-03-09 06:17:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-09 06:17:17,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:17,925 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:17:17,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:17:17,925 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:17:17,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:17,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2093948912, now seen corresponding path program 1 times [2025-03-09 06:17:17,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:17,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982909175] [2025-03-09 06:17:17,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:17,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:17,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:17:18,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:17:18,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:18,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:18,136 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:17:18,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:18,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982909175] [2025-03-09 06:17:18,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982909175] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:17:18,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [869950623] [2025-03-09 06:17:18,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:18,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:17:18,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:17:18,139 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:17:18,141 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:17:18,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-09 06:17:18,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-09 06:17:18,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:18,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:18,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:17:18,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:18,531 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:17:18,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:17:18,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [869950623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:17:18,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:17:18,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [4] total 10 [2025-03-09 06:17:18,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192470408] [2025-03-09 06:17:18,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:17:18,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:17:18,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:18,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:17:18,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:17:18,535 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:17:19,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:19,193 INFO L93 Difference]: Finished difference Result 1153 states and 1560 transitions. [2025-03-09 06:17:19,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:17:19,193 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:17:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:19,195 INFO L225 Difference]: With dead ends: 1153 [2025-03-09 06:17:19,195 INFO L226 Difference]: Without dead ends: 665 [2025-03-09 06:17:19,196 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:17:19,197 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 40 mSDsluCounter, 1942 mSDsCounter, 0 mSdLazyCounter, 1000 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:17:19,197 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.6s Time] [2025-03-09 06:17:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2025-03-09 06:17:19,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 645. [2025-03-09 06:17:19,208 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:17:19,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 873 transitions. [2025-03-09 06:17:19,209 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 873 transitions. Word has length 105 [2025-03-09 06:17:19,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:19,209 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 873 transitions. [2025-03-09 06:17:19,209 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:17:19,209 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 873 transitions. [2025-03-09 06:17:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 06:17:19,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:19,210 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:17:19,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:17:19,411 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:17:19,411 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:17:19,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:19,413 INFO L85 PathProgramCache]: Analyzing trace with hash 423112676, now seen corresponding path program 1 times [2025-03-09 06:17:19,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:19,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198643105] [2025-03-09 06:17:19,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:19,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:19,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 06:17:19,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 06:17:19,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:19,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:19,727 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:17:19,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:19,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198643105] [2025-03-09 06:17:19,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198643105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:17:19,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:17:19,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 06:17:19,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750712442] [2025-03-09 06:17:19,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:17:19,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:17:19,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:19,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:17:19,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:17:19,729 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:17:20,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:20,557 INFO L93 Difference]: Finished difference Result 1161 states and 1572 transitions. [2025-03-09 06:17:20,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:17:20,557 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:17:20,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:20,559 INFO L225 Difference]: With dead ends: 1161 [2025-03-09 06:17:20,559 INFO L226 Difference]: Without dead ends: 663 [2025-03-09 06:17:20,560 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:17:20,560 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 23 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 1395 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.8s IncrementalHoareTripleChecker+Time [2025-03-09 06:17:20,560 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.8s Time] [2025-03-09 06:17:20,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2025-03-09 06:17:20,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 651. [2025-03-09 06:17:20,570 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:17:20,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 879 transitions. [2025-03-09 06:17:20,571 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 879 transitions. Word has length 106 [2025-03-09 06:17:20,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:20,571 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 879 transitions. [2025-03-09 06:17:20,572 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:17:20,572 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 879 transitions. [2025-03-09 06:17:20,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-09 06:17:20,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:20,572 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:17:20,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:17:20,573 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:17:20,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:20,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1065625549, now seen corresponding path program 1 times [2025-03-09 06:17:20,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:20,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255873982] [2025-03-09 06:17:20,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:20,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:20,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 06:17:20,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 06:17:20,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:20,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:20,803 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:17:20,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:20,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255873982] [2025-03-09 06:17:20,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255873982] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:17:20,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849635153] [2025-03-09 06:17:20,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:17:20,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:17:20,806 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:17:20,808 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:17:21,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-09 06:17:21,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-09 06:17:21,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:21,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:21,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 612 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:17:21,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:21,118 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:17:21,155 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:17:21,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:17:21,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849635153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:17:21,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:17:21,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [4] total 7 [2025-03-09 06:17:21,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701212367] [2025-03-09 06:17:21,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:17:21,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:17:21,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:21,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:17:21,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:17:21,156 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:17:21,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:21,344 INFO L93 Difference]: Finished difference Result 1115 states and 1505 transitions. [2025-03-09 06:17:21,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:17:21,344 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:17:21,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:21,348 INFO L225 Difference]: With dead ends: 1115 [2025-03-09 06:17:21,348 INFO L226 Difference]: Without dead ends: 654 [2025-03-09 06:17:21,349 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:17:21,349 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:17:21,349 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:17:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-03-09 06:17:21,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2025-03-09 06:17:21,361 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:17:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 884 transitions. [2025-03-09 06:17:21,362 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 884 transitions. Word has length 106 [2025-03-09 06:17:21,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:21,362 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 884 transitions. [2025-03-09 06:17:21,363 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:17:21,363 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 884 transitions. [2025-03-09 06:17:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-09 06:17:21,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:21,363 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:17:21,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-09 06:17:21,564 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:17:21,564 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:17:21,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:21,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2006427921, now seen corresponding path program 1 times [2025-03-09 06:17:21,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:21,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944668154] [2025-03-09 06:17:21,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:21,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:21,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:17:21,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:17:21,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:21,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:21,916 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:17:21,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:21,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944668154] [2025-03-09 06:17:21,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944668154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:17:21,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777902338] [2025-03-09 06:17:21,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:21,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:17:21,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:17:21,920 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:17:21,921 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:17:22,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-09 06:17:22,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-09 06:17:22,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:22,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:22,387 INFO L256 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-09 06:17:22,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:22,397 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:17:22,748 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:17:22,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:17:22,988 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:17:22,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777902338] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:17:22,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:17:22,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 9] total 17 [2025-03-09 06:17:22,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968505771] [2025-03-09 06:17:22,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:17:22,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-09 06:17:22,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:22,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-09 06:17:22,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2025-03-09 06:17:22,989 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:17:27,807 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:17:31,816 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:17:35,833 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:17:35,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:35,986 INFO L93 Difference]: Finished difference Result 1352 states and 1823 transitions. [2025-03-09 06:17:35,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-09 06:17:35,987 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:17:35,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:35,990 INFO L225 Difference]: With dead ends: 1352 [2025-03-09 06:17:35,990 INFO L226 Difference]: Without dead ends: 886 [2025-03-09 06:17:35,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 202 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=604, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:17:35,991 INFO L435 NwaCegarLoop]: 486 mSDtfsCounter, 523 mSDsluCounter, 4729 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.6s 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, 12.7s IncrementalHoareTripleChecker+Time [2025-03-09 06:17:35,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [526 Valid, 5215 Invalid, 818 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 801 Invalid, 3 Unknown, 0 Unchecked, 12.7s Time] [2025-03-09 06:17:35,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-03-09 06:17:36,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 738. [2025-03-09 06:17:36,008 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:17:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1001 transitions. [2025-03-09 06:17:36,010 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1001 transitions. Word has length 108 [2025-03-09 06:17:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:36,010 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1001 transitions. [2025-03-09 06:17:36,010 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:17:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1001 transitions. [2025-03-09 06:17:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-09 06:17:36,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:36,012 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:17:36,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-09 06:17:36,216 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:17:36,216 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:17:36,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1550802995, now seen corresponding path program 2 times [2025-03-09 06:17:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:36,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685445196] [2025-03-09 06:17:36,216 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:17:36,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:36,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 06:17:36,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 112 of 112 statements. [2025-03-09 06:17:36,335 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:17:36,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:36,547 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:17:36,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685445196] [2025-03-09 06:17:36,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685445196] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:17:36,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631803651] [2025-03-09 06:17:36,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:17:36,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:17:36,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:17:36,550 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:17:36,553 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:17:36,802 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 112 statements into 2 equivalence classes. [2025-03-09 06:17:36,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 112 statements. [2025-03-09 06:17:36,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 06:17:36,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:36,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:17:36,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:36,819 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:17:36,826 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:17:36,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:17:36,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631803651] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:17:36,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:17:36,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2025-03-09 06:17:36,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011825117] [2025-03-09 06:17:36,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:17:36,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:17:36,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:36,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:17:36,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:17:36,827 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:17:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:36,894 INFO L93 Difference]: Finished difference Result 738 states and 1001 transitions. [2025-03-09 06:17:36,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:17:36,894 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:17:36,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:36,896 INFO L225 Difference]: With dead ends: 738 [2025-03-09 06:17:36,897 INFO L226 Difference]: Without dead ends: 737 [2025-03-09 06:17:36,901 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:17:36,901 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 1 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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:17:36,901 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:17:36,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-03-09 06:17:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 737. [2025-03-09 06:17:36,927 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:17:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1000 transitions. [2025-03-09 06:17:36,928 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1000 transitions. Word has length 112 [2025-03-09 06:17:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:36,928 INFO L471 AbstractCegarLoop]: Abstraction has 737 states and 1000 transitions. [2025-03-09 06:17:36,929 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:17:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1000 transitions. [2025-03-09 06:17:36,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 06:17:36,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:36,930 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:17:36,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-09 06:17:37,130 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:17:37,131 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:17:37,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:37,132 INFO L85 PathProgramCache]: Analyzing trace with hash -830251945, now seen corresponding path program 1 times [2025-03-09 06:17:37,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:37,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066058781] [2025-03-09 06:17:37,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:37,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:37,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:17:37,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:17:37,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:37,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:37,437 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:17:37,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:37,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066058781] [2025-03-09 06:17:37,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066058781] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:17:37,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059039998] [2025-03-09 06:17:37,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:37,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:17:37,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:17:37,446 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:17:37,458 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:17:37,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:17:38,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:17:38,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:38,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:38,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-09 06:17:38,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:38,616 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:17:38,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:17:38,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059039998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:17:38,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:17:38,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2025-03-09 06:17:38,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335180109] [2025-03-09 06:17:38,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:17:38,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:17:38,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:38,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:17:38,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2025-03-09 06:17:38,618 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:17:43,118 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 [] [2025-03-09 06:17:44,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:44,023 INFO L93 Difference]: Finished difference Result 1348 states and 1834 transitions. [2025-03-09 06:17:44,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:17:44,024 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:17:44,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:44,026 INFO L225 Difference]: With dead ends: 1348 [2025-03-09 06:17:44,026 INFO L226 Difference]: Without dead ends: 761 [2025-03-09 06:17:44,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 106 SyntacticMatches, 1 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:17:44,028 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 17 mSDsluCounter, 2523 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2946 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:17:44,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2946 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1421 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2025-03-09 06:17:44,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2025-03-09 06:17:44,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 751. [2025-03-09 06:17:44,042 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:17:44,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 751 states and 1018 transitions. [2025-03-09 06:17:44,043 INFO L78 Accepts]: Start accepts. Automaton has 751 states and 1018 transitions. Word has length 113 [2025-03-09 06:17:44,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:44,043 INFO L471 AbstractCegarLoop]: Abstraction has 751 states and 1018 transitions. [2025-03-09 06:17:44,043 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:17:44,044 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1018 transitions. [2025-03-09 06:17:44,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 06:17:44,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:44,045 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:17:44,060 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-09 06:17:44,245 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:17:44,245 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:17:44,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:44,246 INFO L85 PathProgramCache]: Analyzing trace with hash 539602359, now seen corresponding path program 1 times [2025-03-09 06:17:44,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:44,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503612828] [2025-03-09 06:17:44,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:44,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:44,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:17:44,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:17:44,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:44,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:44,527 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:17:44,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:44,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503612828] [2025-03-09 06:17:44,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503612828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:17:44,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996213943] [2025-03-09 06:17:44,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:44,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:17:44,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:17:44,529 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:17:44,530 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:17:44,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:17:44,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:17:44,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:44,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:44,927 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-09 06:17:44,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:45,018 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:17:45,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:17:45,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996213943] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:17:45,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:17:45,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-09 06:17:45,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276416461] [2025-03-09 06:17:45,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:17:45,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:17:45,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:45,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:17:45,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:17:45,019 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:17:45,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:45,506 INFO L93 Difference]: Finished difference Result 1368 states and 1858 transitions. [2025-03-09 06:17:45,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:17:45,507 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:17:45,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:45,510 INFO L225 Difference]: With dead ends: 1368 [2025-03-09 06:17:45,510 INFO L226 Difference]: Without dead ends: 779 [2025-03-09 06:17:45,511 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:17:45,512 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.4s IncrementalHoareTripleChecker+Time [2025-03-09 06:17:45,512 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.4s Time] [2025-03-09 06:17:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2025-03-09 06:17:45,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 765. [2025-03-09 06:17:45,529 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:17:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1038 transitions. [2025-03-09 06:17:45,530 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1038 transitions. Word has length 113 [2025-03-09 06:17:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:45,530 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1038 transitions. [2025-03-09 06:17:45,531 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:17:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1038 transitions. [2025-03-09 06:17:45,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-09 06:17:45,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:45,532 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:17:45,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-09 06:17:45,732 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:17:45,732 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:17:45,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:45,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1666113293, now seen corresponding path program 1 times [2025-03-09 06:17:45,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:45,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400276943] [2025-03-09 06:17:45,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:45,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:45,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:17:45,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:17:45,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:45,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:46,012 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:17:46,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:46,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400276943] [2025-03-09 06:17:46,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400276943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:17:46,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876808780] [2025-03-09 06:17:46,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:46,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:17:46,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:17:46,014 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:17:46,017 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:17:46,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-09 06:17:46,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-09 06:17:46,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:46,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:46,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-09 06:17:46,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:46,556 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:17:46,556 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:17:46,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876808780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:17:46,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:17:46,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2025-03-09 06:17:46,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598356919] [2025-03-09 06:17:46,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:17:46,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:17:46,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:46,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:17:46,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-09 06:17:46,557 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:17:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:47,180 INFO L93 Difference]: Finished difference Result 1376 states and 1870 transitions. [2025-03-09 06:17:47,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:17:47,180 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:17:47,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:47,183 INFO L225 Difference]: With dead ends: 1376 [2025-03-09 06:17:47,183 INFO L226 Difference]: Without dead ends: 775 [2025-03-09 06:17:47,184 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:17:47,184 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 10 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2025-03-09 06:17:47,184 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.6s Time] [2025-03-09 06:17:47,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2025-03-09 06:17:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 765. [2025-03-09 06:17:47,197 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:17:47,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1038 transitions. [2025-03-09 06:17:47,199 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1038 transitions. Word has length 113 [2025-03-09 06:17:47,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:47,199 INFO L471 AbstractCegarLoop]: Abstraction has 765 states and 1038 transitions. [2025-03-09 06:17:47,199 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:17:47,199 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1038 transitions. [2025-03-09 06:17:47,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-09 06:17:47,200 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:47,200 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:17:47,210 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:17:47,401 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:17:47,402 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:17:47,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:47,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2080430933, now seen corresponding path program 1 times [2025-03-09 06:17:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890433567] [2025-03-09 06:17:47,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:47,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:47,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-09 06:17:47,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 06:17:47,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:47,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:47,725 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:17:47,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:47,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890433567] [2025-03-09 06:17:47,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890433567] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:17:47,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784757725] [2025-03-09 06:17:47,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:17:47,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:17:47,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:17:47,728 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:17:47,730 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:17:47,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-09 06:17:48,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 06:17:48,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:17:48,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:48,100 INFO L256 TraceCheckSpWp]: Trace formula consists of 704 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-09 06:17:48,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:48,190 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:17:48,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:17:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 23 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-09 06:17:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784757725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:17:48,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:17:48,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 8] total 19 [2025-03-09 06:17:48,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283875450] [2025-03-09 06:17:48,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:17:48,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-09 06:17:48,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:17:48,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-09 06:17:48,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:17:48,402 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:17:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:17:48,911 INFO L93 Difference]: Finished difference Result 1261 states and 1713 transitions. [2025-03-09 06:17:48,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-09 06:17:48,911 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:17:48,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:17:48,914 INFO L225 Difference]: With dead ends: 1261 [2025-03-09 06:17:48,914 INFO L226 Difference]: Without dead ends: 566 [2025-03-09 06:17:48,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=519, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:17:48,915 INFO L435 NwaCegarLoop]: 353 mSDtfsCounter, 30 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 2453 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:17:48,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 2453 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 06:17:48,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2025-03-09 06:17:48,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 556. [2025-03-09 06:17:48,928 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:17:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 732 transitions. [2025-03-09 06:17:48,930 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 732 transitions. Word has length 114 [2025-03-09 06:17:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:17:48,930 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 732 transitions. [2025-03-09 06:17:48,930 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:17:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 732 transitions. [2025-03-09 06:17:48,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-09 06:17:48,931 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:17:48,931 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:17:48,941 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:17:49,131 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:17:49,132 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:17:49,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:17:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1257341647, now seen corresponding path program 2 times [2025-03-09 06:17:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:17:49,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755678526] [2025-03-09 06:17:49,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:17:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:17:49,175 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-09 06:17:49,232 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 06:17:49,232 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:17:49,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:49,493 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:17:49,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:17:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755678526] [2025-03-09 06:17:49,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755678526] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:17:49,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [252221477] [2025-03-09 06:17:49,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:17:49,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:17:49,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:17:49,496 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:17:49,498 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:17:49,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 123 statements into 2 equivalence classes. [2025-03-09 06:17:50,746 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-03-09 06:17:50,746 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:17:50,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:17:50,752 INFO L256 TraceCheckSpWp]: Trace formula consists of 839 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-09 06:17:50,755 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:17:50,864 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:17:50,864 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:18:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 6 proven. 79 refuted. 4 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 06:18:07,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [252221477] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:18:07,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:18:07,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2025-03-09 06:18:07,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260224491] [2025-03-09 06:18:07,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:18:07,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-09 06:18:07,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:18:07,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-09 06:18:07,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=274, Unknown=4, NotChecked=0, Total=420 [2025-03-09 06:18:07,088 INFO L87 Difference]: Start difference. First operand 556 states and 732 transitions. Second operand has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:18:07,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:18:07,816 INFO L93 Difference]: Finished difference Result 1009 states and 1337 transitions. [2025-03-09 06:18:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-09 06:18:07,817 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) Word has length 123 [2025-03-09 06:18:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:18:07,819 INFO L225 Difference]: With dead ends: 1009 [2025-03-09 06:18:07,819 INFO L226 Difference]: Without dead ends: 570 [2025-03-09 06:18:07,820 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 264 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=367, Invalid=621, Unknown=4, NotChecked=0, Total=992 [2025-03-09 06:18:07,820 INFO L435 NwaCegarLoop]: 364 mSDtfsCounter, 9 mSDsluCounter, 2529 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2893 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 06:18:07,820 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2893 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 06:18:07,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2025-03-09 06:18:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2025-03-09 06:18:07,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 553 states have (on average 1.3200723327305606) internal successors, (730), 559 states have internal predecessors, (730), 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:18:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 744 transitions. [2025-03-09 06:18:07,839 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 744 transitions. Word has length 123 [2025-03-09 06:18:07,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:18:07,840 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 744 transitions. [2025-03-09 06:18:07,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.095238095238095) internal successors, (128), 21 states have internal predecessors, (128), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 1 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-09 06:18:07,840 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 744 transitions. [2025-03-09 06:18:07,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 06:18:07,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:18:07,841 INFO L218 NwaCegarLoop]: trace histogram [22, 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:18:07,863 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-09 06:18:08,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-09 06:18:08,046 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:18:08,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:18:08,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1510632917, now seen corresponding path program 3 times [2025-03-09 06:18:08,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:18:08,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718475862] [2025-03-09 06:18:08,047 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 06:18:08,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:18:08,097 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 9 equivalence classes. [2025-03-09 06:18:08,121 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 101 of 130 statements. [2025-03-09 06:18:08,122 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-09 06:18:08,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:18:08,452 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2025-03-09 06:18:08,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:18:08,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718475862] [2025-03-09 06:18:08,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718475862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:18:08,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:18:08,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 06:18:08,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452671808] [2025-03-09 06:18:08,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:18:08,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:18:08,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:18:08,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:18:08,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:18:08,454 INFO L87 Difference]: Start difference. First operand 570 states and 744 transitions. Second operand has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 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:18:08,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 06:18:08,975 INFO L93 Difference]: Finished difference Result 1064 states and 1397 transitions. [2025-03-09 06:18:08,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:18:08,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 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 130 [2025-03-09 06:18:08,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 06:18:08,978 INFO L225 Difference]: With dead ends: 1064 [2025-03-09 06:18:08,978 INFO L226 Difference]: Without dead ends: 584 [2025-03-09 06:18:08,979 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:18:08,979 INFO L435 NwaCegarLoop]: 347 mSDtfsCounter, 13 mSDsluCounter, 2083 mSDsCounter, 0 mSdLazyCounter, 740 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 2430 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-09 06:18:08,979 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 2430 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 740 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-09 06:18:08,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2025-03-09 06:18:08,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 570. [2025-03-09 06:18:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 553 states have (on average 1.3200723327305606) internal successors, (730), 559 states have internal predecessors, (730), 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:18:08,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 744 transitions. [2025-03-09 06:18:09,000 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 744 transitions. Word has length 130 [2025-03-09 06:18:09,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 06:18:09,000 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 744 transitions. [2025-03-09 06:18:09,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.2) internal successors, (102), 10 states have internal predecessors, (102), 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:18:09,000 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 744 transitions. [2025-03-09 06:18:09,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-09 06:18:09,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 06:18:09,001 INFO L218 NwaCegarLoop]: trace histogram [22, 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:18:09,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 06:18:09,002 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2025-03-09 06:18:09,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:18:09,002 INFO L85 PathProgramCache]: Analyzing trace with hash -107513154, now seen corresponding path program 1 times [2025-03-09 06:18:09,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:18:09,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749675026] [2025-03-09 06:18:09,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:18:09,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:18:09,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-09 06:18:09,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-09 06:18:09,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:18:09,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:18:09,798 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 6 proven. 223 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-09 06:18:09,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:18:09,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749675026] [2025-03-09 06:18:09,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749675026] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:18:09,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954557419] [2025-03-09 06:18:09,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:18:09,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:18:09,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:18:09,801 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:18:09,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-09 06:18:10,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes.