./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-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 64bit --witnessprinter.graph.data.programhash 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 05:52:50,449 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 05:52:50,504 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-09 05:52:50,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 05:52:50,509 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 05:52:50,522 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 05:52:50,523 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 05:52:50,523 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 05:52:50,523 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 05:52:50,523 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 05:52:50,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 05:52:50,524 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 05:52:50,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 05:52:50,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 05:52:50,524 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 05:52:50,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 05:52:50,524 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 05:52:50,524 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 05:52:50,525 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 05:52:50,525 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:52:50,526 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 05:52:50,526 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 05:52:50,526 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 [2025-03-09 05:52:50,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:52:50,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:52:50,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:52:50,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:52:50,787 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:52:50,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2025-03-09 05:52:51,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f390ccb6/b74f063a685a4d4b85e0b73e2056872c/FLAG9326ded06 [2025-03-09 05:52:52,267 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:52:52,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2025-03-09 05:52:52,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f390ccb6/b74f063a685a4d4b85e0b73e2056872c/FLAG9326ded06 [2025-03-09 05:52:52,309 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f390ccb6/b74f063a685a4d4b85e0b73e2056872c [2025-03-09 05:52:52,311 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:52:52,312 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:52:52,313 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:52:52,313 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:52:52,316 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:52:52,317 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:52:52" (1/1) ... [2025-03-09 05:52:52,319 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@486eb593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:52, skipping insertion in model container [2025-03-09 05:52:52,319 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:52:52" (1/1) ... [2025-03-09 05:52:52,360 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:52:52,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:52:52,878 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:52:52,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:52:53,028 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:52:53,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53 WrapperNode [2025-03-09 05:52:53,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:52:53,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:52:53,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:52:53,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:52:53,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,055 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,100 INFO L138 Inliner]: procedures = 524, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 486 [2025-03-09 05:52:53,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:52:53,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:52:53,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:52:53,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:52:53,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,118 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,151 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 6, 355, 2, 2, 2]. 96 percent of accesses are in the largest equivalence class. The 357 initializations are split as follows [2, 0, 355, 0, 0, 0]. The 7 writes are split as follows [0, 2, 0, 1, 2, 2]. [2025-03-09 05:52:53,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,178 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,198 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:52:53,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:52:53,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:52:53,199 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:52:53,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (1/1) ... [2025-03-09 05:52:53,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:52:53,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:53,231 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 05:52:53,233 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 05:52:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:52:53,250 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:52:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:52:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 05:52:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 05:52:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 05:52:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 05:52:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 05:52:53,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 05:52:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:52:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:52:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:52:53,252 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:52:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 05:52:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 05:52:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 05:52:53,252 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 05:52:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 05:52:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 05:52:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 05:52:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 05:52:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 05:52:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 05:52:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 05:52:53,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-09 05:52:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 05:52:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 05:52:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 05:52:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 05:52:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 05:52:53,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-09 05:52:53,497 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:52:53,498 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:52:53,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1793: havoc gethostid_#t~nondet74#1; [2025-03-09 05:52:53,759 INFO L? ?]: Removed 39 outVars from TransFormulas that were not future-live. [2025-03-09 05:52:53,759 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:52:53,766 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:52:53,767 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:52:53,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:52:53 BoogieIcfgContainer [2025-03-09 05:52:53,768 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:52:53,769 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:52:53,769 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:52:53,773 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:52:53,773 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:52:52" (1/3) ... [2025-03-09 05:52:53,774 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a082dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:52:53, skipping insertion in model container [2025-03-09 05:52:53,774 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:52:53" (2/3) ... [2025-03-09 05:52:53,775 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16a082dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:52:53, skipping insertion in model container [2025-03-09 05:52:53,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:52:53" (3/3) ... [2025-03-09 05:52:53,776 INFO L128 eAbstractionObserver]: Analyzing ICFG hostid.i [2025-03-09 05:52:53,788 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:52:53,789 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hostid.i that has 2 procedures, 46 locations, 1 initial locations, 5 loop locations, and 13 error locations. [2025-03-09 05:52:53,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:52:53,837 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;@60042ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:52:53,837 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-09 05:52:53,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 43 states have internal predecessors, (50), 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 05:52:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:52:53,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:53,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:52:53,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:53,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:53,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2584831, now seen corresponding path program 1 times [2025-03-09 05:52:53,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:53,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812456323] [2025-03-09 05:52:53,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:53,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:54,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:52:54,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:52:54,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:54,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:54,341 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 05:52:54,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:54,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812456323] [2025-03-09 05:52:54,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812456323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:54,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:54,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:54,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824995099] [2025-03-09 05:52:54,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:54,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:54,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:54,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:54,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:54,365 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 43 states have internal predecessors, (50), 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 05:52:54,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:54,398 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2025-03-09 05:52:54,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:54,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2025-03-09 05:52:54,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:54,404 INFO L225 Difference]: With dead ends: 80 [2025-03-09 05:52:54,404 INFO L226 Difference]: Without dead ends: 39 [2025-03-09 05:52:54,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:54,409 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:54,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 68 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-09 05:52:54,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-09 05:52:54,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.5384615384615385) internal successors, (40), 36 states have internal predecessors, (40), 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 05:52:54,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-03-09 05:52:54,437 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 4 [2025-03-09 05:52:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:54,438 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-09 05:52:54,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 05:52:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-03-09 05:52:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-03-09 05:52:54,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:54,439 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2025-03-09 05:52:54,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 05:52:54,440 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:54,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:54,440 INFO L85 PathProgramCache]: Analyzing trace with hash -304693007, now seen corresponding path program 1 times [2025-03-09 05:52:54,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:54,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994484227] [2025-03-09 05:52:54,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:54,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:54,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:52:54,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:52:54,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:54,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:54,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:54,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994484227] [2025-03-09 05:52:54,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994484227] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:54,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639697799] [2025-03-09 05:52:54,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:54,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:54,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:54,663 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 05:52:54,664 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 05:52:54,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 05:52:54,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 05:52:54,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:54,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:54,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 802 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:52:54,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:54,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:54,938 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:52:54,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639697799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:54,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:52:54,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:52:54,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784031733] [2025-03-09 05:52:54,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:54,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:52:54,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:54,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:52:54,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:54,941 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:52:54,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:54,961 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-03-09 05:52:54,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:52:54,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-03-09 05:52:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:54,963 INFO L225 Difference]: With dead ends: 39 [2025-03-09 05:52:54,963 INFO L226 Difference]: Without dead ends: 38 [2025-03-09 05:52:54,963 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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 05:52:54,964 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:54,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 97 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:54,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-09 05:52:54,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-09 05:52:54,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.5) internal successors, (39), 35 states have internal predecessors, (39), 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 05:52:54,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2025-03-09 05:52:54,969 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 7 [2025-03-09 05:52:54,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:54,972 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2025-03-09 05:52:54,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 05:52:54,972 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2025-03-09 05:52:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:52:54,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:54,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:52:54,982 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 05:52:55,174 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 05:52:55,174 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:55,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:55,175 INFO L85 PathProgramCache]: Analyzing trace with hash -855548607, now seen corresponding path program 1 times [2025-03-09 05:52:55,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:55,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017371985] [2025-03-09 05:52:55,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:55,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:55,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:52:55,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:52:55,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:55,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:55,292 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:52:55,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:55,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017371985] [2025-03-09 05:52:55,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017371985] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:55,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:55,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:55,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158955206] [2025-03-09 05:52:55,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:55,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:55,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:55,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:55,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:55,293 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 05:52:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:55,303 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2025-03-09 05:52:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:55,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 05:52:55,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:55,304 INFO L225 Difference]: With dead ends: 38 [2025-03-09 05:52:55,304 INFO L226 Difference]: Without dead ends: 37 [2025-03-09 05:52:55,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:55,305 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:55,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 66 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:55,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-09 05:52:55,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2025-03-09 05:52:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.5) internal successors, (36), 32 states have internal predecessors, (36), 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 05:52:55,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-09 05:52:55,311 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 8 [2025-03-09 05:52:55,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:55,311 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-09 05:52:55,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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 05:52:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-09 05:52:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-09 05:52:55,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:55,311 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:55,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 05:52:55,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:55,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:55,312 INFO L85 PathProgramCache]: Analyzing trace with hash -2050558403, now seen corresponding path program 1 times [2025-03-09 05:52:55,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:55,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830208826] [2025-03-09 05:52:55,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:55,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:55,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:52:55,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:52:55,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:55,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:55,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:55,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830208826] [2025-03-09 05:52:55,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830208826] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:55,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733699749] [2025-03-09 05:52:55,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:55,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:55,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:55,455 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 05:52:55,456 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 05:52:55,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 05:52:55,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 05:52:55,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:55,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:55,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 807 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:52:55,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:55,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 05:52:55,661 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:52:55,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733699749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:55,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:52:55,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-09 05:52:55,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33477746] [2025-03-09 05:52:55,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:55,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:55,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:55,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:55,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:55,663 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 05:52:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:55,679 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2025-03-09 05:52:55,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:55,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 12 [2025-03-09 05:52:55,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:55,680 INFO L225 Difference]: With dead ends: 35 [2025-03-09 05:52:55,680 INFO L226 Difference]: Without dead ends: 33 [2025-03-09 05:52:55,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:55,681 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 22 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:55,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 35 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:55,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-09 05:52:55,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-09 05:52:55,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 30 states have internal predecessors, (34), 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 05:52:55,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2025-03-09 05:52:55,688 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 12 [2025-03-09 05:52:55,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:55,688 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2025-03-09 05:52:55,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 05:52:55,688 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2025-03-09 05:52:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-09 05:52:55,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:55,688 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:55,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 05:52:55,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-09 05:52:55,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:55,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash 857198959, now seen corresponding path program 1 times [2025-03-09 05:52:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:55,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363386755] [2025-03-09 05:52:55,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:55,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:55,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:52:55,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:52:55,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:55,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:56,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363386755] [2025-03-09 05:52:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363386755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:56,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900303282] [2025-03-09 05:52:56,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:56,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:56,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:56,022 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 05:52:56,024 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 05:52:56,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 05:52:56,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 05:52:56,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:56,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:56,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 808 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:52:56,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:56,221 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:56,248 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:56,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900303282] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:56,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:52:56,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:52:56,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465807169] [2025-03-09 05:52:56,248 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:56,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:52:56,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:56,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:52:56,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:56,249 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:52:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:56,285 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2025-03-09 05:52:56,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:52:56,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 13 [2025-03-09 05:52:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:56,289 INFO L225 Difference]: With dead ends: 69 [2025-03-09 05:52:56,289 INFO L226 Difference]: Without dead ends: 42 [2025-03-09 05:52:56,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:56,289 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:56,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 152 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2025-03-09 05:52:56,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2025-03-09 05:52:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 33 states have (on average 1.303030303030303) internal successors, (43), 39 states have internal predecessors, (43), 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 05:52:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2025-03-09 05:52:56,294 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 13 [2025-03-09 05:52:56,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:56,294 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2025-03-09 05:52:56,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:52:56,295 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2025-03-09 05:52:56,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:52:56,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:56,296 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:56,303 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 05:52:56,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:56,496 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:56,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:56,497 INFO L85 PathProgramCache]: Analyzing trace with hash -176696195, now seen corresponding path program 2 times [2025-03-09 05:52:56,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:56,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293400560] [2025-03-09 05:52:56,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:52:56,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:56,517 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-09 05:52:56,537 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 22 statements. [2025-03-09 05:52:56,537 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:52:56,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:56,694 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:52:56,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:56,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293400560] [2025-03-09 05:52:56,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293400560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:56,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:56,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:52:56,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986113142] [2025-03-09 05:52:56,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:56,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:52:56,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:56,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:52:56,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:56,696 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 05:52:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:56,725 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2025-03-09 05:52:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:52:56,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 22 [2025-03-09 05:52:56,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:56,726 INFO L225 Difference]: With dead ends: 42 [2025-03-09 05:52:56,726 INFO L226 Difference]: Without dead ends: 40 [2025-03-09 05:52:56,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:56,727 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 21 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:56,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-09 05:52:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-09 05:52:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 37 states have internal predecessors, (41), 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 05:52:56,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2025-03-09 05:52:56,732 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 22 [2025-03-09 05:52:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:56,733 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2025-03-09 05:52:56,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 05:52:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2025-03-09 05:52:56,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-09 05:52:56,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:56,733 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:56,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 05:52:56,733 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:56,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:56,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1982536362, now seen corresponding path program 1 times [2025-03-09 05:52:56,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:56,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696072658] [2025-03-09 05:52:56,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:56,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:56,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-09 05:52:56,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-09 05:52:56,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:56,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:56,881 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-09 05:52:56,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:56,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696072658] [2025-03-09 05:52:56,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696072658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:56,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:56,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:56,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707264834] [2025-03-09 05:52:56,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:56,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:56,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:56,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:56,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:56,885 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 05:52:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:56,903 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2025-03-09 05:52:56,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:56,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 27 [2025-03-09 05:52:56,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:56,904 INFO L225 Difference]: With dead ends: 59 [2025-03-09 05:52:56,904 INFO L226 Difference]: Without dead ends: 43 [2025-03-09 05:52:56,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:56,904 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:56,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 55 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-09 05:52:56,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-09 05:52:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 40 states have internal predecessors, (44), 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 05:52:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2025-03-09 05:52:56,908 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 27 [2025-03-09 05:52:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:56,908 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2025-03-09 05:52:56,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 05:52:56,908 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2025-03-09 05:52:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-09 05:52:56,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:56,909 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:56,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 05:52:56,909 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:56,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:56,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1758533860, now seen corresponding path program 1 times [2025-03-09 05:52:56,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:56,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246459045] [2025-03-09 05:52:56,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:56,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:56,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 05:52:56,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 05:52:56,950 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:56,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:57,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246459045] [2025-03-09 05:52:57,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246459045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:57,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431297914] [2025-03-09 05:52:57,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:57,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:57,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:57,111 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 05:52:57,113 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 05:52:57,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-09 05:52:57,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-09 05:52:57,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:57,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:57,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:52:57,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:57,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:52:57,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431297914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:57,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:52:57,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 05:52:57,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975130741] [2025-03-09 05:52:57,402 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:57,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:52:57,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:57,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:52:57,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:52:57,403 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:52:57,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:57,441 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2025-03-09 05:52:57,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:52:57,441 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2025-03-09 05:52:57,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:57,442 INFO L225 Difference]: With dead ends: 89 [2025-03-09 05:52:57,442 INFO L226 Difference]: Without dead ends: 61 [2025-03-09 05:52:57,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:52:57,442 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:57,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:57,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-09 05:52:57,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-09 05:52:57,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 58 states have internal predecessors, (62), 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 05:52:57,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2025-03-09 05:52:57,446 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 29 [2025-03-09 05:52:57,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:57,446 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2025-03-09 05:52:57,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:52:57,446 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2025-03-09 05:52:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-09 05:52:57,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:57,447 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:57,455 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 05:52:57,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:57,649 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:57,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:57,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1341060828, now seen corresponding path program 2 times [2025-03-09 05:52:57,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:57,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755708297] [2025-03-09 05:52:57,650 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:52:57,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:57,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 47 statements into 2 equivalence classes. [2025-03-09 05:52:57,710 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 47 statements. [2025-03-09 05:52:57,710 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-09 05:52:57,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:57,878 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:57,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:57,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755708297] [2025-03-09 05:52:57,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755708297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:57,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:57,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:52:57,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996717339] [2025-03-09 05:52:57,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:57,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:52:57,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:57,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:52:57,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:52:57,882 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 05:52:57,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:57,935 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2025-03-09 05:52:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:52:57,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 47 [2025-03-09 05:52:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:57,937 INFO L225 Difference]: With dead ends: 80 [2025-03-09 05:52:57,937 INFO L226 Difference]: Without dead ends: 72 [2025-03-09 05:52:57,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:52:57,938 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:57,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-09 05:52:57,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2025-03-09 05:52:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 63 states have (on average 1.1746031746031746) internal successors, (74), 67 states have internal predecessors, (74), 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 05:52:57,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2025-03-09 05:52:57,944 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 47 [2025-03-09 05:52:57,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:57,944 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2025-03-09 05:52:57,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 05:52:57,945 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2025-03-09 05:52:57,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-09 05:52:57,945 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:57,945 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:57,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 05:52:57,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:57,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1051337322, now seen corresponding path program 1 times [2025-03-09 05:52:57,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:57,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495825548] [2025-03-09 05:52:57,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:57,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:57,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 05:52:57,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 05:52:57,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:57,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:58,102 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:58,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:58,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495825548] [2025-03-09 05:52:58,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495825548] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:58,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343880431] [2025-03-09 05:52:58,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:58,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:58,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:58,105 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 05:52:58,106 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 05:52:58,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-09 05:52:58,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-09 05:52:58,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:58,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:58,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 1111 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:52:58,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:58,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:52:58,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343880431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:58,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 05:52:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-09 05:52:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003746482] [2025-03-09 05:52:58,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:58,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 05:52:58,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:58,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 05:52:58,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:52:58,362 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 05:52:58,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:58,383 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2025-03-09 05:52:58,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 05:52:58,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 48 [2025-03-09 05:52:58,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:58,385 INFO L225 Difference]: With dead ends: 70 [2025-03-09 05:52:58,385 INFO L226 Difference]: Without dead ends: 69 [2025-03-09 05:52:58,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 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 05:52:58,386 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:58,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 77 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-09 05:52:58,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-09 05:52:58,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 63 states have (on average 1.1428571428571428) internal successors, (72), 66 states have internal predecessors, (72), 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 05:52:58,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2025-03-09 05:52:58,393 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 48 [2025-03-09 05:52:58,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:58,393 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2025-03-09 05:52:58,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 05:52:58,394 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2025-03-09 05:52:58,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-09 05:52:58,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:58,395 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:58,403 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 05:52:58,599 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,SelfDestructingSolverStorable9 [2025-03-09 05:52:58,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:58,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:58,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1768281388, now seen corresponding path program 1 times [2025-03-09 05:52:58,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:58,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291181129] [2025-03-09 05:52:58,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:58,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:58,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 05:52:58,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 05:52:58,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:58,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:58,705 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-09 05:52:58,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:58,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291181129] [2025-03-09 05:52:58,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291181129] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:52:58,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:52:58,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:52:58,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885179491] [2025-03-09 05:52:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:52:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:52:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:58,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:52:58,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:58,707 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 05:52:58,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:58,718 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2025-03-09 05:52:58,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:52:58,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2025-03-09 05:52:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:58,719 INFO L225 Difference]: With dead ends: 69 [2025-03-09 05:52:58,719 INFO L226 Difference]: Without dead ends: 68 [2025-03-09 05:52:58,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:52:58,720 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:58,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:58,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-09 05:52:58,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 64. [2025-03-09 05:52:58,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.11864406779661) internal successors, (66), 61 states have internal predecessors, (66), 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 05:52:58,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2025-03-09 05:52:58,724 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 49 [2025-03-09 05:52:58,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:58,725 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2025-03-09 05:52:58,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 05:52:58,725 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2025-03-09 05:52:58,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-09 05:52:58,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:58,725 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 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 05:52:58,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 05:52:58,728 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:58,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:58,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1482981200, now seen corresponding path program 1 times [2025-03-09 05:52:58,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:58,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827542422] [2025-03-09 05:52:58,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:58,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:58,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 05:52:58,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 05:52:58,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:58,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:58,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:58,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827542422] [2025-03-09 05:52:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827542422] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:58,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145891723] [2025-03-09 05:52:58,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:52:58,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:58,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:58,893 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 05:52:58,895 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 05:52:59,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 05:52:59,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 05:52:59,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:52:59,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:59,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:52:59,145 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:59,157 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:59,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:52:59,178 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:59,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145891723] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:52:59,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:52:59,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-09 05:52:59,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922311738] [2025-03-09 05:52:59,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:52:59,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 05:52:59,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:52:59,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 05:52:59,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:59,182 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 05:52:59,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:52:59,206 INFO L93 Difference]: Finished difference Result 99 states and 111 transitions. [2025-03-09 05:52:59,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:52:59,206 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 54 [2025-03-09 05:52:59,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:52:59,207 INFO L225 Difference]: With dead ends: 99 [2025-03-09 05:52:59,207 INFO L226 Difference]: Without dead ends: 82 [2025-03-09 05:52:59,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:52:59,207 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:52:59,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:52:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-09 05:52:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-09 05:52:59,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 79 states have internal predecessors, (84), 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 05:52:59,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2025-03-09 05:52:59,212 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 54 [2025-03-09 05:52:59,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:52:59,212 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2025-03-09 05:52:59,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 7 states have internal predecessors, (34), 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 05:52:59,212 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2025-03-09 05:52:59,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-09 05:52:59,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:52:59,213 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:52:59,221 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 05:52:59,417 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:59,417 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:52:59,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:52:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1326575140, now seen corresponding path program 2 times [2025-03-09 05:52:59,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:52:59,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341260776] [2025-03-09 05:52:59,418 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:52:59,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:52:59,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-09 05:52:59,503 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 05:52:59,504 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:52:59,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:59,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 05:52:59,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341260776] [2025-03-09 05:52:59,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341260776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 05:52:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60609616] [2025-03-09 05:52:59,655 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:52:59,655 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:52:59,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:52:59,657 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 05:52:59,658 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 05:52:59,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 63 statements into 2 equivalence classes. [2025-03-09 05:52:59,935 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 63 of 63 statements. [2025-03-09 05:52:59,936 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:52:59,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:52:59,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 1193 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 05:52:59,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:52:59,973 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:52:59,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-03-09 05:53:00,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60609616] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:00,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 05:53:00,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-03-09 05:53:00,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003415323] [2025-03-09 05:53:00,034 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:00,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-09 05:53:00,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 05:53:00,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-09 05:53:00,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:53:00,035 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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 05:53:00,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:00,085 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2025-03-09 05:53:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-09 05:53:00,085 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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 63 [2025-03-09 05:53:00,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:00,086 INFO L225 Difference]: With dead ends: 144 [2025-03-09 05:53:00,086 INFO L226 Difference]: Without dead ends: 118 [2025-03-09 05:53:00,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-03-09 05:53:00,087 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:00,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 78 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:00,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2025-03-09 05:53:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2025-03-09 05:53:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0619469026548674) internal successors, (120), 115 states have internal predecessors, (120), 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 05:53:00,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2025-03-09 05:53:00,099 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 63 [2025-03-09 05:53:00,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:00,100 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2025-03-09 05:53:00,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 13 states have internal predecessors, (52), 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 05:53:00,100 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2025-03-09 05:53:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-09 05:53:00,101 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:00,102 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:00,114 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 05:53:00,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:00,302 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:00,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:00,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1928908708, now seen corresponding path program 3 times [2025-03-09 05:53:00,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 05:53:00,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132725543] [2025-03-09 05:53:00,303 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 05:53:00,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 05:53:00,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 81 statements into 12 equivalence classes. [2025-03-09 05:53:00,908 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 05:53:00,908 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2025-03-09 05:53:00,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:53:00,909 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-09 05:53:00,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-09 05:53:00,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-09 05:53:00,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:00,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-09 05:53:01,023 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-09 05:53:01,023 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-09 05:53:01,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (12 of 13 remaining) [2025-03-09 05:53:01,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-09 05:53:01,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-09 05:53:01,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-09 05:53:01,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-09 05:53:01,026 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-09 05:53:01,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-09 05:53:01,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-09 05:53:01,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-09 05:53:01,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-09 05:53:01,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-09 05:53:01,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-09 05:53:01,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-09 05:53:01,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 05:53:01,030 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:01,093 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 05:53:01,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 05:53:01 BoogieIcfgContainer [2025-03-09 05:53:01,099 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 05:53:01,099 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 05:53:01,099 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 05:53:01,099 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 05:53:01,100 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:52:53" (3/4) ... [2025-03-09 05:53:01,102 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-09 05:53:01,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 05:53:01,103 INFO L158 Benchmark]: Toolchain (without parser) took 8791.32ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 110.9MB in the beginning and 84.1MB in the end (delta: 26.7MB). Peak memory consumption was 158.7MB. Max. memory is 16.1GB. [2025-03-09 05:53:01,104 INFO L158 Benchmark]: CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 05:53:01,104 INFO L158 Benchmark]: CACSL2BoogieTranslator took 715.73ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 44.1MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-09 05:53:01,104 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.87ms. Allocated memory is still 142.6MB. Free memory was 44.1MB in the beginning and 106.0MB in the end (delta: -61.9MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2025-03-09 05:53:01,105 INFO L158 Benchmark]: Boogie Preprocessor took 97.33ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 100.1MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:53:01,105 INFO L158 Benchmark]: IcfgBuilder took 568.68ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 55.8MB in the end (delta: 44.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-09 05:53:01,105 INFO L158 Benchmark]: TraceAbstraction took 7329.27ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 55.8MB in the beginning and 84.2MB in the end (delta: -28.3MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. [2025-03-09 05:53:01,106 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 268.4MB. Free memory was 84.2MB in the beginning and 84.1MB in the end (delta: 35.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 05:53:01,107 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.96ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 715.73ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 44.1MB in the end (delta: 66.8MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.87ms. Allocated memory is still 142.6MB. Free memory was 44.1MB in the beginning and 106.0MB in the end (delta: -61.9MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.33ms. Allocated memory is still 142.6MB. Free memory was 106.0MB in the beginning and 100.1MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 568.68ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 55.8MB in the end (delta: 44.2MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 7329.27ms. Allocated memory was 142.6MB in the beginning and 268.4MB in the end (delta: 125.8MB). Free memory was 55.8MB in the beginning and 84.2MB in the end (delta: -28.3MB). Peak memory consumption was 92.9MB. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 268.4MB. Free memory was 84.2MB in the beginning and 84.1MB in the end (delta: 35.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1774]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1774. Possible FailurePath: [L1763] static const char *applet_name; [L1764] static signed int bb_errno_location; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; [L1795] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1858] char *a = malloc(11); [L1859] a[10] = 0 [L1860] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=1] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=2] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=3] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=4] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=5] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=6] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=7] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=8] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=9] [L1860] COND TRUE i<10 [L1861] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}] [L1860] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno_location=0, dummy_utmp={3:0}, i=10] [L1860] COND FALSE !(i<10) [L1862] applet_name = a [L1863] bb_errno_location = __VERIFIER_nondet_int() [L1864] optind = 1 [L1865] int argc = __VERIFIER_nondet_int(); [L1866] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L1866] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [applet_name={-1:0}, argc=1, bb_errno_location=0, dummy_utmp={3:0}, optind=1] [L1867] EXPR argc+1 [L1867] char **argv=malloc((argc+1)*sizeof(char*)); [L1868] EXPR argc+1 [L1868] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1869] argv[argc]=0 [L1870] int i=0; VAL [applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno_location=0, dummy_utmp={3:0}, i=0, mem_track={-13:0}, optind=1] [L1870] COND TRUE i 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ff8320881bb5cbc5b52aa5a0a8dd146a23603ac32480303b1494fa48d4d27d8 [2025-03-09 05:53:03,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 05:53:03,388 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 05:53:03,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 05:53:03,390 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 05:53:03,390 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 05:53:03,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2025-03-09 05:53:04,632 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21bdade13/c9faa79b49354a7a904bebb362d48985/FLAGdc942c60d [2025-03-09 05:53:04,930 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 05:53:04,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2025-03-09 05:53:04,956 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21bdade13/c9faa79b49354a7a904bebb362d48985/FLAGdc942c60d [2025-03-09 05:53:05,183 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21bdade13/c9faa79b49354a7a904bebb362d48985 [2025-03-09 05:53:05,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 05:53:05,186 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 05:53:05,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 05:53:05,187 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 05:53:05,190 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 05:53:05,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:05,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e3df108 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05, skipping insertion in model container [2025-03-09 05:53:05,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:05,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 05:53:05,671 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:53:05,675 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:53:05,688 WARN L1100 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2025-03-09 05:53:05,696 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:53:05,721 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 05:53:05,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 05:53:05,956 INFO L204 MainTranslator]: Completed translation [2025-03-09 05:53:05,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05 WrapperNode [2025-03-09 05:53:05,956 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 05:53:05,957 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 05:53:05,957 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 05:53:05,957 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 05:53:05,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:05,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,032 INFO L138 Inliner]: procedures = 531, calls = 407, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 479 [2025-03-09 05:53:06,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 05:53:06,033 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 05:53:06,033 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 05:53:06,033 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 05:53:06,039 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,039 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,050 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,073 INFO L175 MemorySlicer]: Split 369 memory accesses to 6 slices as follows [2, 2, 2, 355, 6, 2]. 96 percent of accesses are in the largest equivalence class. The 357 initializations are split as follows [2, 0, 0, 355, 0, 0]. The 7 writes are split as follows [0, 2, 2, 0, 2, 1]. [2025-03-09 05:53:06,076 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,076 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,096 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,097 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,102 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,104 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,109 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 05:53:06,110 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 05:53:06,110 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 05:53:06,110 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 05:53:06,111 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (1/1) ... [2025-03-09 05:53:06,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 05:53:06,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:06,140 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 05:53:06,143 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 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-09 05:53:06,159 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 05:53:06,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-09 05:53:06,160 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-09 05:53:06,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-09 05:53:06,371 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 05:53:06,373 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 05:53:06,764 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1793: havoc gethostid_#t~nondet74#1; [2025-03-09 05:53:06,773 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-09 05:53:06,774 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 05:53:06,780 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 05:53:06,781 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 05:53:06,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:53:06 BoogieIcfgContainer [2025-03-09 05:53:06,781 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 05:53:06,782 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 05:53:06,782 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 05:53:06,786 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 05:53:06,786 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 05:53:05" (1/3) ... [2025-03-09 05:53:06,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd7992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:53:06, skipping insertion in model container [2025-03-09 05:53:06,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 05:53:05" (2/3) ... [2025-03-09 05:53:06,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bd7992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 05:53:06, skipping insertion in model container [2025-03-09 05:53:06,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 05:53:06" (3/3) ... [2025-03-09 05:53:06,788 INFO L128 eAbstractionObserver]: Analyzing ICFG hostid.i [2025-03-09 05:53:06,797 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 05:53:06,798 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hostid.i that has 2 procedures, 46 locations, 1 initial locations, 5 loop locations, and 13 error locations. [2025-03-09 05:53:06,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 05:53:06,838 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;@7213f4dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 05:53:06,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-09 05:53:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 43 states have internal predecessors, (50), 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 05:53:06,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-09 05:53:06,846 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:06,847 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-09 05:53:06,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:06,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash 2584831, now seen corresponding path program 1 times [2025-03-09 05:53:06,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:06,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1348588054] [2025-03-09 05:53:06,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:06,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:06,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:06,865 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 05:53:06,866 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 05:53:07,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-09 05:53:07,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-09 05:53:07,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:07,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:07,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 402 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-09 05:53:07,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:07,500 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 05:53:07,501 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:07,501 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:07,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348588054] [2025-03-09 05:53:07,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1348588054] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:07,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:07,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 05:53:07,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066168938] [2025-03-09 05:53:07,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:07,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-09 05:53:07,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:07,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-09 05:53:07,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-09 05:53:07,525 INFO L87 Difference]: Start difference. First operand has 46 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 43 states have internal predecessors, (50), 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) Second operand has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 05:53:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:07,535 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2025-03-09 05:53:07,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-09 05:53:07,536 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 4 [2025-03-09 05:53:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:07,540 INFO L225 Difference]: With dead ends: 68 [2025-03-09 05:53:07,540 INFO L226 Difference]: Without dead ends: 31 [2025-03-09 05:53:07,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 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 05:53:07,544 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:07,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-09 05:53:07,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-09 05:53:07,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.391304347826087) internal successors, (32), 28 states have internal predecessors, (32), 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 05:53:07,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2025-03-09 05:53:07,566 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 4 [2025-03-09 05:53:07,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:07,566 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2025-03-09 05:53:07,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 4.0) internal successors, (4), 2 states have internal predecessors, (4), 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 05:53:07,567 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2025-03-09 05:53:07,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-09 05:53:07,567 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:07,567 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-09 05:53:07,594 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 05:53:07,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:07,768 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:07,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:07,769 INFO L85 PathProgramCache]: Analyzing trace with hash 80129779, now seen corresponding path program 1 times [2025-03-09 05:53:07,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:07,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242920834] [2025-03-09 05:53:07,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:07,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:07,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:07,772 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 05:53:07,774 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 05:53:07,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-09 05:53:08,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-09 05:53:08,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:08,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:08,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:53:08,343 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:08,365 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 05:53:08,366 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:08,366 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:08,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242920834] [2025-03-09 05:53:08,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242920834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:08,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:08,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:53:08,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271071759] [2025-03-09 05:53:08,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:08,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:08,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:08,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:08,367 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 05:53:08,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:08,393 INFO L93 Difference]: Finished difference Result 60 states and 66 transitions. [2025-03-09 05:53:08,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:08,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2025-03-09 05:53:08,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:08,395 INFO L225 Difference]: With dead ends: 60 [2025-03-09 05:53:08,395 INFO L226 Difference]: Without dead ends: 34 [2025-03-09 05:53:08,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:08,396 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:08,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-09 05:53:08,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-09 05:53:08,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 31 states have internal predecessors, (35), 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 05:53:08,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-03-09 05:53:08,403 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2025-03-09 05:53:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:08,403 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-03-09 05:53:08,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 05:53:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-03-09 05:53:08,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-09 05:53:08,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:08,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1] [2025-03-09 05:53:08,430 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 05:53:08,606 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 [2025-03-09 05:53:08,606 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:08,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:08,606 INFO L85 PathProgramCache]: Analyzing trace with hash -855548607, now seen corresponding path program 1 times [2025-03-09 05:53:08,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:08,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1914647812] [2025-03-09 05:53:08,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:08,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:08,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:08,610 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 05:53:08,611 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 05:53:08,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 05:53:09,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 05:53:09,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:09,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:09,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:09,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:09,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:09,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 05:53:09,242 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:09,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914647812] [2025-03-09 05:53:09,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914647812] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:09,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:09,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:53:09,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825813624] [2025-03-09 05:53:09,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:09,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:09,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:09,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:09,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:09,244 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 05:53:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:09,300 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2025-03-09 05:53:09,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:09,302 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 05:53:09,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:09,303 INFO L225 Difference]: With dead ends: 63 [2025-03-09 05:53:09,303 INFO L226 Difference]: Without dead ends: 37 [2025-03-09 05:53:09,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:09,304 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:09,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:09,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-09 05:53:09,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2025-03-09 05:53:09,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 31 states have internal predecessors, (35), 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 05:53:09,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2025-03-09 05:53:09,310 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 8 [2025-03-09 05:53:09,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:09,311 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2025-03-09 05:53:09,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 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 05:53:09,311 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2025-03-09 05:53:09,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-09 05:53:09,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:09,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:09,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-09 05:53:09,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:09,513 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:09,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:09,513 INFO L85 PathProgramCache]: Analyzing trace with hash -778153539, now seen corresponding path program 1 times [2025-03-09 05:53:09,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:09,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406285661] [2025-03-09 05:53:09,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:09,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:09,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:09,516 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 05:53:09,517 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 05:53:09,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 05:53:10,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 05:53:10,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:10,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:10,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:53:10,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:10,139 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:53:10,139 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:10,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:10,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406285661] [2025-03-09 05:53:10,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406285661] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:10,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:10,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 05:53:10,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494404629] [2025-03-09 05:53:10,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:10,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 05:53:10,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:10,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 05:53:10,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:10,142 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 05:53:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:10,362 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2025-03-09 05:53:10,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 05:53:10,363 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 16 [2025-03-09 05:53:10,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:10,364 INFO L225 Difference]: With dead ends: 34 [2025-03-09 05:53:10,364 INFO L226 Difference]: Without dead ends: 32 [2025-03-09 05:53:10,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 05:53:10,364 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:10,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 71 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:53:10,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-09 05:53:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-09 05:53:10,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 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 05:53:10,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2025-03-09 05:53:10,367 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 16 [2025-03-09 05:53:10,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:10,368 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2025-03-09 05:53:10,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 05:53:10,368 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2025-03-09 05:53:10,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-09 05:53:10,368 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:10,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:10,401 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 05:53:10,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:10,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:10,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:10,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1688483880, now seen corresponding path program 1 times [2025-03-09 05:53:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226813899] [2025-03-09 05:53:10,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:10,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:10,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:10,572 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 05:53:10,573 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 05:53:10,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 05:53:11,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 05:53:11,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:11,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:11,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-09 05:53:11,170 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:53:11,180 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:11,180 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:11,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226813899] [2025-03-09 05:53:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226813899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:11,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:11,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 05:53:11,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463069121] [2025-03-09 05:53:11,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:11,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 05:53:11,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:11,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 05:53:11,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 05:53:11,182 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 05:53:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:11,211 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2025-03-09 05:53:11,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 05:53:11,211 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 22 [2025-03-09 05:53:11,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:11,212 INFO L225 Difference]: With dead ends: 49 [2025-03-09 05:53:11,212 INFO L226 Difference]: Without dead ends: 35 [2025-03-09 05:53:11,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 05:53:11,213 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:11,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-09 05:53:11,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2025-03-09 05:53:11,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2025-03-09 05:53:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 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 05:53:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2025-03-09 05:53:11,216 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 22 [2025-03-09 05:53:11,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:11,216 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2025-03-09 05:53:11,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (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 05:53:11,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2025-03-09 05:53:11,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-09 05:53:11,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:11,217 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] [2025-03-09 05:53:11,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-09 05:53:11,417 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 [2025-03-09 05:53:11,417 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:11,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:11,418 INFO L85 PathProgramCache]: Analyzing trace with hash -813891108, now seen corresponding path program 1 times [2025-03-09 05:53:11,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:11,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1650545019] [2025-03-09 05:53:11,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:11,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:11,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:11,420 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 05:53:11,421 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 05:53:11,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 05:53:11,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 05:53:11,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:11,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:11,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 05:53:11,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:12,045 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:53:12,046 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 05:53:12,046 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:12,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650545019] [2025-03-09 05:53:12,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650545019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 05:53:12,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 05:53:12,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 05:53:12,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091214722] [2025-03-09 05:53:12,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 05:53:12,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:12,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:12,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:12,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:12,047 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 05:53:12,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:12,316 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2025-03-09 05:53:12,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:12,317 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 23 [2025-03-09 05:53:12,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:12,317 INFO L225 Difference]: With dead ends: 52 [2025-03-09 05:53:12,317 INFO L226 Difference]: Without dead ends: 45 [2025-03-09 05:53:12,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:12,318 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 31 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:12,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 72 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-09 05:53:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-09 05:53:12,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2025-03-09 05:53:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 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 05:53:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2025-03-09 05:53:12,323 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 23 [2025-03-09 05:53:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:12,324 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2025-03-09 05:53:12,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 05:53:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2025-03-09 05:53:12,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-09 05:53:12,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:12,324 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:12,352 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 05:53:12,525 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 [2025-03-09 05:53:12,525 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:12,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:12,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1033707564, now seen corresponding path program 1 times [2025-03-09 05:53:12,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:12,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806021900] [2025-03-09 05:53:12,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:12,527 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:12,527 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:12,529 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 05:53:12,530 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 05:53:12,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 05:53:13,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 05:53:13,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:13,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:13,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 523 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-09 05:53:13,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:13,245 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:53:13,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:13,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-09 05:53:13,289 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:13,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806021900] [2025-03-09 05:53:13,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806021900] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:13,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:13,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2025-03-09 05:53:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595075282] [2025-03-09 05:53:13,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:13,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 05:53:13,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:13,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 05:53:13,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-09 05:53:13,290 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 05:53:13,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:13,391 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2025-03-09 05:53:13,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 05:53:13,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 25 [2025-03-09 05:53:13,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:13,394 INFO L225 Difference]: With dead ends: 70 [2025-03-09 05:53:13,394 INFO L226 Difference]: Without dead ends: 51 [2025-03-09 05:53:13,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-09 05:53:13,395 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:13,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:13,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-09 05:53:13,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2025-03-09 05:53:13,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.146341463414634) internal successors, (47), 42 states have internal predecessors, (47), 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 05:53:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2025-03-09 05:53:13,401 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2025-03-09 05:53:13,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:13,401 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2025-03-09 05:53:13,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 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 05:53:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2025-03-09 05:53:13,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-09 05:53:13,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:13,402 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-09 05:53:13,435 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 05:53:13,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:13,603 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:13,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:13,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2015242076, now seen corresponding path program 1 times [2025-03-09 05:53:13,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:13,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58949954] [2025-03-09 05:53:13,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 05:53:13,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:13,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:13,606 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 05:53:13,607 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 05:53:13,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-09 05:53:14,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-09 05:53:14,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 05:53:14,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:14,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:53:14,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:14,343 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 05:53:14,343 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:14,386 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-09 05:53:14,387 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:14,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58949954] [2025-03-09 05:53:14,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58949954] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:14,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:14,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 05:53:14,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888307359] [2025-03-09 05:53:14,387 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:14,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:53:14,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:14,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:53:14,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:14,388 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:14,500 INFO L93 Difference]: Finished difference Result 93 states and 104 transitions. [2025-03-09 05:53:14,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:53:14,502 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-09 05:53:14,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:14,503 INFO L225 Difference]: With dead ends: 93 [2025-03-09 05:53:14,503 INFO L226 Difference]: Without dead ends: 57 [2025-03-09 05:53:14,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 05:53:14,504 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:14,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-09 05:53:14,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-09 05:53:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2025-03-09 05:53:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 54 states have internal predecessors, (59), 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 05:53:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-03-09 05:53:14,513 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 33 [2025-03-09 05:53:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:14,513 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-03-09 05:53:14,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.875) internal successors, (39), 8 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-09 05:53:14,515 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-03-09 05:53:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-09 05:53:14,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:14,516 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:14,547 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 05:53:14,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:14,717 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:14,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:14,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1462080292, now seen corresponding path program 2 times [2025-03-09 05:53:14,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:14,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [475928423] [2025-03-09 05:53:14,718 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 05:53:14,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:14,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:14,720 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 05:53:14,721 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 05:53:14,826 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-09 05:53:15,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-09 05:53:15,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 05:53:15,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 05:53:15,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 594 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 05:53:15,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 05:53:15,706 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-09 05:53:15,706 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 05:53:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-09 05:53:15,742 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-09 05:53:15,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475928423] [2025-03-09 05:53:15,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475928423] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 05:53:15,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-09 05:53:15,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2025-03-09 05:53:15,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139882036] [2025-03-09 05:53:15,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-09 05:53:15,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 05:53:15,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-09 05:53:15,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 05:53:15,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-09 05:53:15,743 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 05:53:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-09 05:53:15,955 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2025-03-09 05:53:15,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 05:53:15,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 45 [2025-03-09 05:53:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-09 05:53:15,956 INFO L225 Difference]: With dead ends: 100 [2025-03-09 05:53:15,956 INFO L226 Difference]: Without dead ends: 81 [2025-03-09 05:53:15,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-03-09 05:53:15,957 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 10 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-09 05:53:15,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 123 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-09 05:53:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-09 05:53:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-09 05:53:15,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 77 states have (on average 1.077922077922078) internal successors, (83), 78 states have internal predecessors, (83), 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 05:53:15,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2025-03-09 05:53:15,964 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 45 [2025-03-09 05:53:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-09 05:53:15,965 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2025-03-09 05:53:15,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 05:53:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2025-03-09 05:53:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-09 05:53:15,966 INFO L210 NwaCegarLoop]: Found error trace [2025-03-09 05:53:15,966 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 05:53:16,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-09 05:53:16,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:16,166 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONUNSUPPORTED_FEATURE (and 10 more)] === [2025-03-09 05:53:16,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 05:53:16,167 INFO L85 PathProgramCache]: Analyzing trace with hash 301446180, now seen corresponding path program 3 times [2025-03-09 05:53:16,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-09 05:53:16,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [309856096] [2025-03-09 05:53:16,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-09 05:53:16,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 05:53:16,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 05:53:16,169 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 05:53:16,176 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 05:53:16,288 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 57 statements into 8 equivalence classes.