./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:38:58,574 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:38:58,618 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:38:58,623 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:38:58,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:38:58,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:38:58,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:38:58,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:38:58,645 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:38:58,645 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:38:58,645 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:38:58,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:38:58,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:38:58,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:38:58,645 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:38:58,645 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:38:58,645 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:38:58,646 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:38:58,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:38:58,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:38:58,647 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:38:58,647 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:38:58,647 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:38:58,648 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:38:58,648 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:38:58,648 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:38:58,648 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:38:58,648 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:38:58,648 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:38:58,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:38:58,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:38:58,648 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:38:58,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:38:58,649 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:38:58,649 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 [2025-03-04 01:38:58,851 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:38:58,858 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:38:58,860 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:38:58,861 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:38:58,861 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:38:58,862 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2025-03-04 01:39:00,004 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbe911b0/7dcf8df8ca4549498977fddb6312abb5/FLAG919d4b12d [2025-03-04 01:39:00,260 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:39:00,260 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2025-03-04 01:39:00,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbe911b0/7dcf8df8ca4549498977fddb6312abb5/FLAG919d4b12d [2025-03-04 01:39:00,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cdbe911b0/7dcf8df8ca4549498977fddb6312abb5 [2025-03-04 01:39:00,285 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:39:00,286 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:39:00,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:00,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:39:00,291 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:39:00,291 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,292 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18185998 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00, skipping insertion in model container [2025-03-04 01:39:00,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:39:00,411 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2025-03-04 01:39:00,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:00,473 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:39:00,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2025-03-04 01:39:00,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:00,534 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:39:00,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00 WrapperNode [2025-03-04 01:39:00,534 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:00,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:00,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:39:00,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:39:00,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,580 INFO L138 Inliner]: procedures = 30, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 549 [2025-03-04 01:39:00,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:00,581 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:39:00,581 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:39:00,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:39:00,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,594 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,602 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2025-03-04 01:39:00,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,618 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,627 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:39:00,636 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:39:00,636 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:39:00,636 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:39:00,637 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (1/1) ... [2025-03-04 01:39:00,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:39:00,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:00,661 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:39:00,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:39:00,680 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:39:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2025-03-04 01:39:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2025-03-04 01:39:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2025-03-04 01:39:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 01:39:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2025-03-04 01:39:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 01:39:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:39:00,681 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:39:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 01:39:00,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:39:00,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:39:00,768 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:39:00,769 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:39:01,157 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~short97#1;havoc property_#t~ite114#1;havoc property_#t~mem99#1;havoc property_#t~mem98#1;havoc property_#t~ite102#1;havoc property_#t~mem100#1;havoc property_#t~mem101#1;havoc property_#t~mem103#1;havoc property_#t~ite111#1;havoc property_#t~mem104#1;havoc property_#t~ite108#1;havoc property_#t~mem105#1;havoc property_#t~mem107#1;havoc property_#t~mem106#1;havoc property_#t~mem110#1;havoc property_#t~mem109#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~bitwise115#1;havoc property_#t~ite120#1;havoc property_#t~mem119#1;havoc property_#t~mem116#1;havoc property_#t~mem117#1;havoc property_#t~short118#1;havoc property_#t~short121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~ite139#1;havoc property_#t~mem124#1;havoc property_#t~mem138#1;havoc property_#t~mem130#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite129#1;havoc property_#t~mem127#1;havoc property_#t~mem128#1;havoc property_#t~ite137#1;havoc property_#t~mem131#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~ite136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short140#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~ite152#1;havoc property_#t~mem143#1;havoc property_#t~mem144#1;havoc property_#t~short145#1;havoc property_#t~ite150#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~mem149#1;havoc property_#t~mem148#1;havoc property_#t~mem151#1;havoc property_#t~short153#1; [2025-03-04 01:39:01,200 INFO L? ?]: Removed 140 outVars from TransFormulas that were not future-live. [2025-03-04 01:39:01,200 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:39:01,216 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:39:01,216 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:39:01,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:01 BoogieIcfgContainer [2025-03-04 01:39:01,216 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:39:01,220 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:39:01,220 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:39:01,223 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:39:01,224 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:39:00" (1/3) ... [2025-03-04 01:39:01,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6577e34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:01, skipping insertion in model container [2025-03-04 01:39:01,225 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:00" (2/3) ... [2025-03-04 01:39:01,225 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6577e34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:01, skipping insertion in model container [2025-03-04 01:39:01,226 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:01" (3/3) ... [2025-03-04 01:39:01,227 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-36.i [2025-03-04 01:39:01,238 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:39:01,241 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-36.i that has 2 procedures, 122 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:39:01,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:39:01,283 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;@4c4e02b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:39:01,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:39:01,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 122 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 109 states have internal predecessors, (160), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:39:01,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:01,297 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:01,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:01,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:01,303 INFO L85 PathProgramCache]: Analyzing trace with hash -911502984, now seen corresponding path program 1 times [2025-03-04 01:39:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:01,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039724823] [2025-03-04 01:39:01,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:01,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:01,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:39:01,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:39:01,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:01,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:01,602 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:39:01,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:01,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039724823] [2025-03-04 01:39:01,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039724823] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:01,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239655280] [2025-03-04 01:39:01,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:01,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:39:01,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:01,606 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:39:01,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:39:01,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:39:01,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:39:01,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:01,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:01,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:39:01,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:39:01,854 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:01,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239655280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:01,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:01,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:39:01,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834810790] [2025-03-04 01:39:01,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:01,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:39:01,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:01,878 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:39:01,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:39:01,880 INFO L87 Difference]: Start difference. First operand has 122 states, 108 states have (on average 1.4814814814814814) internal successors, (160), 109 states have internal predecessors, (160), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:39:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:01,904 INFO L93 Difference]: Finished difference Result 238 states and 370 transitions. [2025-03-04 01:39:01,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:39:01,906 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-03-04 01:39:01,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:01,910 INFO L225 Difference]: With dead ends: 238 [2025-03-04 01:39:01,911 INFO L226 Difference]: Without dead ends: 119 [2025-03-04 01:39:01,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:39:01,917 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:01,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:01,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-04 01:39:01,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-04 01:39:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 106 states have (on average 1.4622641509433962) internal successors, (155), 106 states have internal predecessors, (155), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 177 transitions. [2025-03-04 01:39:01,950 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 177 transitions. Word has length 109 [2025-03-04 01:39:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:01,951 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 177 transitions. [2025-03-04 01:39:01,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:39:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 177 transitions. [2025-03-04 01:39:01,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:39:01,954 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:01,954 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:01,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 01:39:02,155 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,SelfDestructingSolverStorable0 [2025-03-04 01:39:02,155 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:02,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:02,156 INFO L85 PathProgramCache]: Analyzing trace with hash 563885179, now seen corresponding path program 1 times [2025-03-04 01:39:02,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:02,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669278584] [2025-03-04 01:39:02,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:02,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:02,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:39:02,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:39:02,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:02,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:02,444 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:02,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:02,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669278584] [2025-03-04 01:39:02,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669278584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:02,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:02,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:02,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699924918] [2025-03-04 01:39:02,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:02,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:02,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:02,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:02,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:02,448 INFO L87 Difference]: Start difference. First operand 119 states and 177 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:39:02,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:02,489 INFO L93 Difference]: Finished difference Result 237 states and 354 transitions. [2025-03-04 01:39:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:02,493 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 109 [2025-03-04 01:39:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:02,494 INFO L225 Difference]: With dead ends: 237 [2025-03-04 01:39:02,494 INFO L226 Difference]: Without dead ends: 121 [2025-03-04 01:39:02,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:02,495 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:02,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 508 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-04 01:39:02,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2025-03-04 01:39:02,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 108 states have (on average 1.4537037037037037) internal successors, (157), 108 states have internal predecessors, (157), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:02,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 179 transitions. [2025-03-04 01:39:02,501 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 179 transitions. Word has length 109 [2025-03-04 01:39:02,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:02,503 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 179 transitions. [2025-03-04 01:39:02,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:39:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 179 transitions. [2025-03-04 01:39:02,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 01:39:02,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:02,505 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:02,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:39:02,506 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:02,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:02,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1805548806, now seen corresponding path program 1 times [2025-03-04 01:39:02,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:02,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200446834] [2025-03-04 01:39:02,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:02,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:02,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 01:39:02,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 01:39:02,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:02,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:02,844 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:02,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:02,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200446834] [2025-03-04 01:39:02,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200446834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:02,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:02,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:02,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557849723] [2025-03-04 01:39:02,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:02,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:02,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:02,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:02,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:02,845 INFO L87 Difference]: Start difference. First operand 121 states and 179 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:03,075 INFO L93 Difference]: Finished difference Result 358 states and 532 transitions. [2025-03-04 01:39:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:03,076 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 109 [2025-03-04 01:39:03,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:03,078 INFO L225 Difference]: With dead ends: 358 [2025-03-04 01:39:03,078 INFO L226 Difference]: Without dead ends: 240 [2025-03-04 01:39:03,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:39:03,079 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 182 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:03,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 383 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2025-03-04 01:39:03,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 212. [2025-03-04 01:39:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 187 states have (on average 1.4491978609625669) internal successors, (271), 187 states have internal predecessors, (271), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-04 01:39:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 315 transitions. [2025-03-04 01:39:03,108 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 315 transitions. Word has length 109 [2025-03-04 01:39:03,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:03,109 INFO L471 AbstractCegarLoop]: Abstraction has 212 states and 315 transitions. [2025-03-04 01:39:03,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 315 transitions. [2025-03-04 01:39:03,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:39:03,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:03,110 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:03,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:39:03,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:03,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash 969572971, now seen corresponding path program 1 times [2025-03-04 01:39:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9241734] [2025-03-04 01:39:03,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:03,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:03,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:39:03,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:39:03,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:03,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:04,209 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:04,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:04,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9241734] [2025-03-04 01:39:04,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9241734] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:04,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:04,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:04,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196750135] [2025-03-04 01:39:04,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:04,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:04,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:04,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:04,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:04,213 INFO L87 Difference]: Start difference. First operand 212 states and 315 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:04,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:04,452 INFO L93 Difference]: Finished difference Result 492 states and 737 transitions. [2025-03-04 01:39:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:04,452 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:39:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:04,454 INFO L225 Difference]: With dead ends: 492 [2025-03-04 01:39:04,454 INFO L226 Difference]: Without dead ends: 362 [2025-03-04 01:39:04,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:39:04,455 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 119 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:04,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 267 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:04,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2025-03-04 01:39:04,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 358. [2025-03-04 01:39:04,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 321 states have (on average 1.4672897196261683) internal successors, (471), 321 states have internal predecessors, (471), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 01:39:04,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 537 transitions. [2025-03-04 01:39:04,473 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 537 transitions. Word has length 110 [2025-03-04 01:39:04,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:04,473 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 537 transitions. [2025-03-04 01:39:04,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:04,473 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 537 transitions. [2025-03-04 01:39:04,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:39:04,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:04,474 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:04,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:39:04,475 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:04,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1817842516, now seen corresponding path program 1 times [2025-03-04 01:39:04,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:04,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14454326] [2025-03-04 01:39:04,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:04,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:04,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:39:04,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:39:04,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:04,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:05,331 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:05,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:05,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14454326] [2025-03-04 01:39:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14454326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:05,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:05,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:39:05,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135042885] [2025-03-04 01:39:05,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:05,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:39:05,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:05,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:39:05,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:39:05,333 INFO L87 Difference]: Start difference. First operand 358 states and 537 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:05,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:05,548 INFO L93 Difference]: Finished difference Result 600 states and 898 transitions. [2025-03-04 01:39:05,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:39:05,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:39:05,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:05,552 INFO L225 Difference]: With dead ends: 600 [2025-03-04 01:39:05,552 INFO L226 Difference]: Without dead ends: 364 [2025-03-04 01:39:05,553 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:39:05,553 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 117 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:05,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 267 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:39:05,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2025-03-04 01:39:05,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 360. [2025-03-04 01:39:05,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 323 states have (on average 1.4643962848297214) internal successors, (473), 323 states have internal predecessors, (473), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 01:39:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 539 transitions. [2025-03-04 01:39:05,575 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 539 transitions. Word has length 110 [2025-03-04 01:39:05,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:05,575 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 539 transitions. [2025-03-04 01:39:05,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:05,576 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 539 transitions. [2025-03-04 01:39:05,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:39:05,576 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:05,577 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:05,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:39:05,577 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:05,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:05,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1688759797, now seen corresponding path program 1 times [2025-03-04 01:39:05,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:05,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827741186] [2025-03-04 01:39:05,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:05,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:05,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:39:05,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:39:05,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:05,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:06,039 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:06,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:06,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827741186] [2025-03-04 01:39:06,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827741186] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:06,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:06,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:06,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121884442] [2025-03-04 01:39:06,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:06,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:06,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:06,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:06,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:06,042 INFO L87 Difference]: Start difference. First operand 360 states and 539 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:06,632 INFO L93 Difference]: Finished difference Result 1149 states and 1722 transitions. [2025-03-04 01:39:06,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:39:06,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:39:06,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:06,636 INFO L225 Difference]: With dead ends: 1149 [2025-03-04 01:39:06,636 INFO L226 Difference]: Without dead ends: 915 [2025-03-04 01:39:06,637 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:06,637 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 309 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 774 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:06,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 1096 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 774 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:39:06,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2025-03-04 01:39:06,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 438. [2025-03-04 01:39:06,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 401 states have (on average 1.4837905236907731) internal successors, (595), 401 states have internal predecessors, (595), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 01:39:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 661 transitions. [2025-03-04 01:39:06,671 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 661 transitions. Word has length 110 [2025-03-04 01:39:06,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:06,671 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 661 transitions. [2025-03-04 01:39:06,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:06,672 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 661 transitions. [2025-03-04 01:39:06,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:39:06,673 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:06,673 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:06,673 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:39:06,673 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:06,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash -878626232, now seen corresponding path program 1 times [2025-03-04 01:39:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:06,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055147855] [2025-03-04 01:39:06,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:06,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:06,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:39:06,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:39:06,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:06,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:07,145 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:07,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:39:07,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055147855] [2025-03-04 01:39:07,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055147855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:07,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:07,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:07,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083890713] [2025-03-04 01:39:07,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:07,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:07,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:39:07,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:07,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:07,146 INFO L87 Difference]: Start difference. First operand 438 states and 661 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:39:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:07,580 INFO L93 Difference]: Finished difference Result 949 states and 1424 transitions. [2025-03-04 01:39:07,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:39:07,580 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 112 [2025-03-04 01:39:07,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:07,583 INFO L225 Difference]: With dead ends: 949 [2025-03-04 01:39:07,583 INFO L226 Difference]: Without dead ends: 676 [2025-03-04 01:39:07,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:39:07,584 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 140 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:07,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 577 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:39:07,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2025-03-04 01:39:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 380. [2025-03-04 01:39:07,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 343 states have (on average 1.4606413994169096) internal successors, (501), 343 states have internal predecessors, (501), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2025-03-04 01:39:07,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 567 transitions. [2025-03-04 01:39:07,605 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 567 transitions. Word has length 112 [2025-03-04 01:39:07,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:07,606 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 567 transitions. [2025-03-04 01:39:07,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:39:07,606 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 567 transitions. [2025-03-04 01:39:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:39:07,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:07,607 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:07,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:39:07,607 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:07,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1666873874, now seen corresponding path program 1 times [2025-03-04 01:39:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:39:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436587011] [2025-03-04 01:39:07,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:07,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:39:07,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:39:07,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:39:07,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:07,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:39:07,654 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:39:07,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:39:07,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:39:07,676 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:07,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:39:07,712 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:39:07,712 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:39:07,714 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:39:07,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:39:07,717 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:07,761 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:39:07,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:39:07 BoogieIcfgContainer [2025-03-04 01:39:07,766 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:39:07,766 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:39:07,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:39:07,766 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:39:07,767 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:01" (3/4) ... [2025-03-04 01:39:07,769 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:39:07,769 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:39:07,770 INFO L158 Benchmark]: Toolchain (without parser) took 7484.10ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 154.3MB in the beginning and 116.1MB in the end (delta: 38.2MB). Peak memory consumption was 147.4MB. Max. memory is 16.1GB. [2025-03-04 01:39:07,770 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:39:07,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.62ms. Allocated memory is still 201.3MB. Free memory was 153.9MB in the beginning and 138.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:39:07,770 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.28ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 134.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:39:07,770 INFO L158 Benchmark]: Boogie Preprocessor took 55.08ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 130.9MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:39:07,770 INFO L158 Benchmark]: IcfgBuilder took 579.98ms. Allocated memory is still 201.3MB. Free memory was 130.9MB in the beginning and 95.8MB in the end (delta: 35.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:39:07,773 INFO L158 Benchmark]: TraceAbstraction took 6545.93ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 95.4MB in the beginning and 116.2MB in the end (delta: -20.8MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. [2025-03-04 01:39:07,773 INFO L158 Benchmark]: Witness Printer took 3.04ms. Allocated memory is still 310.4MB. Free memory was 116.2MB in the beginning and 116.1MB in the end (delta: 96.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:39:07,774 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.25ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 247.62ms. Allocated memory is still 201.3MB. Free memory was 153.9MB in the beginning and 138.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.28ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 134.0MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 55.08ms. Allocated memory is still 201.3MB. Free memory was 134.0MB in the beginning and 130.9MB in the end (delta: 3.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 579.98ms. Allocated memory is still 201.3MB. Free memory was 130.9MB in the beginning and 95.8MB in the end (delta: 35.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 6545.93ms. Allocated memory was 201.3MB in the beginning and 310.4MB in the end (delta: 109.1MB). Free memory was 95.4MB in the beginning and 116.2MB in the end (delta: -20.8MB). Peak memory consumption was 88.7MB. Max. memory is 16.1GB. * Witness Printer took 3.04ms. Allocated memory is still 310.4MB. Free memory was 116.2MB in the beginning and 116.1MB in the end (delta: 96.9kB). There was no memory consumed. 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: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 55, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 89, overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 58, overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 72, overapproximation of someBinaryDOUBLEComparisonOperation at line 103, overapproximation of someBinaryDOUBLEComparisonOperation at line 112. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L51] unsigned char last_1_WrapperStruct00_var_1_14 = 1; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_14=1] [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR WrapperStruct00.var_1_14 [L109] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L88] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L89] EXPR WrapperStruct00.var_1_3 [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_3 [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_11 [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_11 [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L100] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L104] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L120] RET updateVariables() [L121] CALL step() [L55] EXPR last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L55] COND FALSE !((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) [L58] EXPR WrapperStruct00.var_1_13 [L58] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L58] COND FALSE !(WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) [L65] WrapperStruct00.var_1_14 = 0 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] EXPR WrapperStruct00.var_1_5 [L67] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] COND TRUE WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3 [L68] WrapperStruct00.var_1_10 = 4.6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L72] EXPR WrapperStruct00.var_1_10 [L72] EXPR WrapperStruct00.var_1_10 [L72] unsigned char stepLocal_0 = WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10; [L73] stepLocal_0 && WrapperStruct00.var_1_7 [L73] EXPR WrapperStruct00.var_1_7 [L73] stepLocal_0 && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L73] COND TRUE stepLocal_0 && WrapperStruct00.var_1_7 [L74] EXPR WrapperStruct00.var_1_10 [L74] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L74] EXPR ((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)) [L74] EXPR WrapperStruct00.var_1_10 [L74] EXPR ((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L74] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L74] COND TRUE ((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10 [L75] WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L75] COND TRUE WrapperStruct00.var_1_7 [L76] WrapperStruct00.var_1_1 = 10u VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR WrapperStruct00.var_1_10 [L112] EXPR WrapperStruct00.var_1_10 [L112] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14)) [L112] EXPR WrapperStruct00.var_1_1 [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112-L113] return (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 122 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 8, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 868 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 867 mSDsluCounter, 3273 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2177 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1895 IncrementalHoareTripleChecker+Invalid, 1991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 1096 mSDtfsCounter, 1895 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 176 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=6, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 809 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 992 NumberOfCodeBlocks, 992 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 870 ConstructedInterpolants, 0 QuantifiedInterpolants, 2038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 403 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 8 InterpolantComputations, 7 PerfectInterpolantSequences, 1740/1760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:39:07,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:39:09,530 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:39:09,619 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:39:09,625 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:39:09,626 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:39:09,647 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:39:09,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:39:09,648 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:39:09,649 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:39:09,649 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:39:09,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:39:09,650 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:39:09,650 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:39:09,650 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:39:09,650 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:39:09,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:39:09,651 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:39:09,651 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:39:09,651 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:39:09,651 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:39:09,651 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:39:09,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:39:09,651 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:39:09,651 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:39:09,651 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:39:09,652 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:39:09,652 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:39:09,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:39:09,653 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:39:09,653 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:39:09,653 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:39:09,653 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:39:09,653 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:39:09,653 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:39:09,653 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4ea2e2ade8e0851c675b880c5454324855941c707d3ca299c056336043784e61 [2025-03-04 01:39:09,891 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:39:09,898 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:39:09,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:39:09,900 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:39:09,900 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:39:09,903 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2025-03-04 01:39:11,007 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663af36f2/66ec4e42ebda427f84e9af18ce47cab9/FLAGfa625dcdc [2025-03-04 01:39:11,182 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:39:11,183 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2025-03-04 01:39:11,189 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663af36f2/66ec4e42ebda427f84e9af18ce47cab9/FLAGfa625dcdc [2025-03-04 01:39:11,205 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/663af36f2/66ec4e42ebda427f84e9af18ce47cab9 [2025-03-04 01:39:11,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:39:11,209 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:39:11,211 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:11,211 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:39:11,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:39:11,214 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3293fe2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11, skipping insertion in model container [2025-03-04 01:39:11,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,231 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:39:11,337 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2025-03-04 01:39:11,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:11,404 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:39:11,414 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i[916,929] [2025-03-04 01:39:11,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:39:11,472 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:39:11,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11 WrapperNode [2025-03-04 01:39:11,472 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:39:11,473 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:11,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:39:11,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:39:11,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,489 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,517 INFO L138 Inliner]: procedures = 37, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 534 [2025-03-04 01:39:11,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:39:11,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:39:11,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:39:11,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:39:11,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,553 INFO L175 MemorySlicer]: Split 134 memory accesses to 2 slices as follows [2, 132]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2025-03-04 01:39:11,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,577 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,578 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,580 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,581 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,588 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:39:11,589 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:39:11,589 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:39:11,589 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:39:11,589 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (1/1) ... [2025-03-04 01:39:11,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:39:11,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:39:11,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:39:11,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:39:11,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2025-03-04 01:39:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2025-03-04 01:39:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:39:11,635 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:39:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2025-03-04 01:39:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2025-03-04 01:39:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:39:11,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:39:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:39:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:39:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:39:11,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:39:11,741 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:39:11,743 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:39:12,631 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L112: havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~short96#1;havoc property_#t~ite113#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~ite101#1;havoc property_#t~mem99#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~ite110#1;havoc property_#t~mem103#1;havoc property_#t~ite107#1;havoc property_#t~mem104#1;havoc property_#t~mem106#1;havoc property_#t~mem105#1;havoc property_#t~mem109#1;havoc property_#t~mem108#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~ite118#1;havoc property_#t~mem117#1;havoc property_#t~mem114#1;havoc property_#t~mem115#1;havoc property_#t~short116#1;havoc property_#t~short119#1;havoc property_#t~mem120#1;havoc property_#t~mem121#1;havoc property_#t~ite137#1;havoc property_#t~mem122#1;havoc property_#t~mem136#1;havoc property_#t~mem128#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite135#1;havoc property_#t~mem129#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite134#1;havoc property_#t~mem132#1;havoc property_#t~mem133#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~ite150#1;havoc property_#t~mem141#1;havoc property_#t~mem142#1;havoc property_#t~short143#1;havoc property_#t~ite148#1;havoc property_#t~mem145#1;havoc property_#t~mem144#1;havoc property_#t~mem147#1;havoc property_#t~mem146#1;havoc property_#t~mem149#1;havoc property_#t~short151#1; [2025-03-04 01:39:12,667 INFO L? ?]: Removed 149 outVars from TransFormulas that were not future-live. [2025-03-04 01:39:12,667 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:39:12,676 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:39:12,676 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:39:12,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:12 BoogieIcfgContainer [2025-03-04 01:39:12,677 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:39:12,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:39:12,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:39:12,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:39:12,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:39:11" (1/3) ... [2025-03-04 01:39:12,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6b3312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:12, skipping insertion in model container [2025-03-04 01:39:12,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:39:11" (2/3) ... [2025-03-04 01:39:12,683 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f6b3312 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:39:12, skipping insertion in model container [2025-03-04 01:39:12,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:39:12" (3/3) ... [2025-03-04 01:39:12,687 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-36.i [2025-03-04 01:39:12,696 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:39:12,697 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-s_file-36.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:39:12,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:39:12,754 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;@1d285b63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:39:12,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:39:12,758 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 105 states have internal predecessors, (154), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:12,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:39:12,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:12,767 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:12,768 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:12,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:12,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1365097744, now seen corresponding path program 1 times [2025-03-04 01:39:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:12,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162624450] [2025-03-04 01:39:12,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:12,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:12,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:12,783 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:12,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:39:12,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:39:13,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:39:13,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:13,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:13,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:39:13,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:13,068 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2025-03-04 01:39:13,068 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:13,068 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:13,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162624450] [2025-03-04 01:39:13,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162624450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:13,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:13,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:39:13,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419270207] [2025-03-04 01:39:13,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:13,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:39:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:13,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:39:13,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:39:13,095 INFO L87 Difference]: Start difference. First operand has 118 states, 104 states have (on average 1.4807692307692308) internal successors, (154), 105 states have internal predecessors, (154), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:39:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:13,111 INFO L93 Difference]: Finished difference Result 226 states and 352 transitions. [2025-03-04 01:39:13,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:39:13,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 108 [2025-03-04 01:39:13,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:13,117 INFO L225 Difference]: With dead ends: 226 [2025-03-04 01:39:13,117 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 01:39:13,120 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:39:13,123 INFO L435 NwaCegarLoop]: 163 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, 163 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-04 01:39:13,123 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:13,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 01:39:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2025-03-04 01:39:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 98 states have (on average 1.4387755102040816) internal successors, (141), 98 states have internal predecessors, (141), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:13,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2025-03-04 01:39:13,148 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 108 [2025-03-04 01:39:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:13,149 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2025-03-04 01:39:13,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-04 01:39:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2025-03-04 01:39:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:39:13,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:13,152 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:13,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:39:13,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:13,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:13,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:13,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1314894733, now seen corresponding path program 1 times [2025-03-04 01:39:13,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:13,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820073159] [2025-03-04 01:39:13,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:13,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:13,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:13,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:13,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:39:13,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:39:13,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:39:13,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:13,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:13,592 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:39:13,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:13,655 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:13,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 208 treesize of output 64 [2025-03-04 01:39:13,679 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:13,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:13,679 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:13,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820073159] [2025-03-04 01:39:13,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820073159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:13,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:39:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885530893] [2025-03-04 01:39:13,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:13,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:39:13,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:13,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:39:13,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:13,681 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:13,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:13,706 INFO L93 Difference]: Finished difference Result 215 states and 316 transitions. [2025-03-04 01:39:13,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:39:13,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-04 01:39:13,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:13,710 INFO L225 Difference]: With dead ends: 215 [2025-03-04 01:39:13,710 INFO L226 Difference]: Without dead ends: 107 [2025-03-04 01:39:13,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:13,711 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 301 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-04 01:39:13,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 301 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-04 01:39:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-04 01:39:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 154 transitions. [2025-03-04 01:39:13,719 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 154 transitions. Word has length 108 [2025-03-04 01:39:13,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:13,720 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 154 transitions. [2025-03-04 01:39:13,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 154 transitions. [2025-03-04 01:39:13,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:39:13,722 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:13,722 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:13,731 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:39:13,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:13,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:13,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:13,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1472520754, now seen corresponding path program 1 times [2025-03-04 01:39:13,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:13,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744740079] [2025-03-04 01:39:13,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:13,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:13,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:13,927 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:13,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:39:14,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:39:14,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:39:14,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:14,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:14,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:39:14,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:14,205 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:14,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:14,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:14,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744740079] [2025-03-04 01:39:14,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744740079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:14,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:14,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 01:39:14,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701958876] [2025-03-04 01:39:14,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:14,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 01:39:14,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:14,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 01:39:14,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:14,206 INFO L87 Difference]: Start difference. First operand 107 states and 154 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:14,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:14,228 INFO L93 Difference]: Finished difference Result 205 states and 296 transitions. [2025-03-04 01:39:14,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 01:39:14,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-04 01:39:14,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:14,230 INFO L225 Difference]: With dead ends: 205 [2025-03-04 01:39:14,230 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:39:14,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 01:39:14,231 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 1 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 279 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-04 01:39:14,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 279 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:14,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:39:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:39:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:14,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2025-03-04 01:39:14,239 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 108 [2025-03-04 01:39:14,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:14,239 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2025-03-04 01:39:14,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:14,239 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2025-03-04 01:39:14,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-04 01:39:14,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:14,240 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:14,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:39:14,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:14,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:14,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1343438035, now seen corresponding path program 1 times [2025-03-04 01:39:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:14,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763625597] [2025-03-04 01:39:14,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:14,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:14,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:14,445 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:14,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:39:14,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 01:39:14,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 01:39:14,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:14,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:14,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:39:14,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:14,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 01:39:14,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 14 [2025-03-04 01:39:14,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-03-04 01:39:14,894 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:14,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:14,894 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:14,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763625597] [2025-03-04 01:39:14,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763625597] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:14,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:14,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:14,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653388997] [2025-03-04 01:39:14,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:14,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:39:14,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:14,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:39:14,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:39:14,895 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:18,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:19,559 INFO L93 Difference]: Finished difference Result 307 states and 437 transitions. [2025-03-04 01:39:19,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:39:19,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 108 [2025-03-04 01:39:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:19,561 INFO L225 Difference]: With dead ends: 307 [2025-03-04 01:39:19,561 INFO L226 Difference]: Without dead ends: 209 [2025-03-04 01:39:19,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:39:19,562 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 131 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:19,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 745 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-04 01:39:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2025-03-04 01:39:19,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 116. [2025-03-04 01:39:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 103 states have internal predecessors, (140), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:19,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2025-03-04 01:39:19,568 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 108 [2025-03-04 01:39:19,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:19,569 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2025-03-04 01:39:19,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2025-03-04 01:39:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:39:19,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:19,570 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:19,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:39:19,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:19,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:19,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:19,771 INFO L85 PathProgramCache]: Analyzing trace with hash -310957334, now seen corresponding path program 1 times [2025-03-04 01:39:19,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:19,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [396786265] [2025-03-04 01:39:19,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:19,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:19,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:19,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:19,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:39:19,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:39:20,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:39:20,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:20,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:20,076 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:39:20,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:20,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 01:39:20,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 19 [2025-03-04 01:39:20,133 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:20,133 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:20,133 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:20,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [396786265] [2025-03-04 01:39:20,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [396786265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:20,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:20,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:39:20,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132882164] [2025-03-04 01:39:20,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:20,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:39:20,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:20,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:39:20,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:39:20,134 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:20,535 INFO L93 Difference]: Finished difference Result 229 states and 321 transitions. [2025-03-04 01:39:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:39:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:39:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:20,537 INFO L225 Difference]: With dead ends: 229 [2025-03-04 01:39:20,537 INFO L226 Difference]: Without dead ends: 116 [2025-03-04 01:39:20,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:20,537 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 114 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:20,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 266 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:39:20,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-03-04 01:39:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2025-03-04 01:39:20,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3636363636363635) internal successors, (120), 88 states have internal predecessors, (120), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2025-03-04 01:39:20,546 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 110 [2025-03-04 01:39:20,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:20,546 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2025-03-04 01:39:20,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:20,546 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2025-03-04 01:39:20,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-04 01:39:20,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:20,547 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:20,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:39:20,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:20,748 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:20,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1535902343, now seen corresponding path program 1 times [2025-03-04 01:39:20,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:20,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225037309] [2025-03-04 01:39:20,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:20,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:20,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:20,751 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:20,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2025-03-04 01:39:20,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 01:39:20,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 01:39:20,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:20,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:20,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:39:20,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:20,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:20,991 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:20,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225037309] [2025-03-04 01:39:20,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225037309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:20,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:20,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:39:20,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477004720] [2025-03-04 01:39:20,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:20,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:39:20,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:20,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:39:20,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:39:20,992 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:21,016 INFO L93 Difference]: Finished difference Result 199 states and 281 transitions. [2025-03-04 01:39:21,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:39:21,016 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 110 [2025-03-04 01:39:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:21,017 INFO L225 Difference]: With dead ends: 199 [2025-03-04 01:39:21,017 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:39:21,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 106 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-04 01:39:21,017 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:21,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:39:21,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:39:21,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-03-04 01:39:21,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:21,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2025-03-04 01:39:21,022 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 110 [2025-03-04 01:39:21,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:21,023 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2025-03-04 01:39:21,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:21,023 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2025-03-04 01:39:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 01:39:21,023 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:21,023 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:21,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:39:21,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:21,224 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:21,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:21,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1633595621, now seen corresponding path program 1 times [2025-03-04 01:39:21,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:21,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011427840] [2025-03-04 01:39:21,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:21,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:21,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:21,227 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:21,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:39:21,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 01:39:21,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 01:39:21,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:21,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:21,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 01:39:21,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:21,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 01:39:21,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2025-03-04 01:39:21,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:21,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 27 [2025-03-04 01:39:21,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:21,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 53 [2025-03-04 01:39:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:21,922 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:21,922 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:21,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011427840] [2025-03-04 01:39:21,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011427840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:21,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:21,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:39:21,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735260797] [2025-03-04 01:39:21,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:21,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:39:21,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:21,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:39:21,923 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:21,923 INFO L87 Difference]: Start difference. First operand 101 states and 141 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:23,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:23,722 INFO L93 Difference]: Finished difference Result 300 states and 421 transitions. [2025-03-04 01:39:23,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:39:23,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 112 [2025-03-04 01:39:23,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:23,724 INFO L225 Difference]: With dead ends: 300 [2025-03-04 01:39:23,725 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 01:39:23,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:39:23,726 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 195 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:23,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 665 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 01:39:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 01:39:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 117. [2025-03-04 01:39:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 104 states have (on average 1.3076923076923077) internal successors, (136), 104 states have internal predecessors, (136), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:23,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 158 transitions. [2025-03-04 01:39:23,736 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 158 transitions. Word has length 112 [2025-03-04 01:39:23,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:23,736 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 158 transitions. [2025-03-04 01:39:23,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:23,736 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 158 transitions. [2025-03-04 01:39:23,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-04 01:39:23,737 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:23,737 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:23,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2025-03-04 01:39:23,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:23,938 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:23,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:23,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1567704541, now seen corresponding path program 1 times [2025-03-04 01:39:23,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:23,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2127558142] [2025-03-04 01:39:23,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:23,939 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:23,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:23,940 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:23,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:39:24,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-04 01:39:24,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-04 01:39:24,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:24,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:24,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:39:24,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:24,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2025-03-04 01:39:24,306 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 14 [2025-03-04 01:39:24,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2025-03-04 01:39:24,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 25 [2025-03-04 01:39:24,389 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:24,389 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:39:24,389 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:24,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2127558142] [2025-03-04 01:39:24,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2127558142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:39:24,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:39:24,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:39:24,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530164699] [2025-03-04 01:39:24,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:24,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:39:24,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:24,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:39:24,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:39:24,391 INFO L87 Difference]: Start difference. First operand 117 states and 158 transitions. Second operand has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:25,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:27,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:39:27,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:27,835 INFO L93 Difference]: Finished difference Result 237 states and 319 transitions. [2025-03-04 01:39:27,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:39:27,835 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 114 [2025-03-04 01:39:27,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:27,837 INFO L225 Difference]: With dead ends: 237 [2025-03-04 01:39:27,837 INFO L226 Difference]: Without dead ends: 235 [2025-03-04 01:39:27,837 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:39:27,837 INFO L435 NwaCegarLoop]: 162 mSDtfsCounter, 112 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:27,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 883 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2025-03-04 01:39:27,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-03-04 01:39:27,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 166. [2025-03-04 01:39:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 153 states have (on average 1.2810457516339868) internal successors, (196), 153 states have internal predecessors, (196), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:27,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 218 transitions. [2025-03-04 01:39:27,858 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 218 transitions. Word has length 114 [2025-03-04 01:39:27,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:27,858 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 218 transitions. [2025-03-04 01:39:27,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:27,858 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 218 transitions. [2025-03-04 01:39:27,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:39:27,859 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:27,859 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:27,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:39:28,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:28,059 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:28,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:28,060 INFO L85 PathProgramCache]: Analyzing trace with hash 1509899439, now seen corresponding path program 1 times [2025-03-04 01:39:28,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:28,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1793073849] [2025-03-04 01:39:28,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:28,060 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:28,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:28,062 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:28,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:39:28,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:39:28,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:39:28,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:28,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:28,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 01:39:28,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:28,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:39:28,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2025-03-04 01:39:28,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2025-03-04 01:39:29,015 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:29,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2025-03-04 01:39:29,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:29,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 87 [2025-03-04 01:39:31,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:31,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 161 treesize of output 113 [2025-03-04 01:39:37,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:37,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 191 treesize of output 119 [2025-03-04 01:39:38,009 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:38,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 175 treesize of output 129 [2025-03-04 01:39:38,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:38,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 185 treesize of output 142 [2025-03-04 01:39:39,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:39,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 198 treesize of output 147 [2025-03-04 01:39:43,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:43,177 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 198 treesize of output 150 [2025-03-04 01:39:43,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:43,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 237 treesize of output 87 [2025-03-04 01:39:43,786 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 92 proven. 96 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-04 01:39:43,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:39:44,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:39:44,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:39:44,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1793073849] [2025-03-04 01:39:44,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1793073849] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:39:44,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:39:44,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [18] total 22 [2025-03-04 01:39:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954188189] [2025-03-04 01:39:44,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:39:44,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:39:44,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:39:44,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:39:44,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=378, Unknown=4, NotChecked=0, Total=462 [2025-03-04 01:39:44,177 INFO L87 Difference]: Start difference. First operand 166 states and 218 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:39:45,001 INFO L93 Difference]: Finished difference Result 363 states and 479 transitions. [2025-03-04 01:39:45,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:39:45,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2025-03-04 01:39:45,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:39:45,005 INFO L225 Difference]: With dead ends: 363 [2025-03-04 01:39:45,005 INFO L226 Difference]: Without dead ends: 200 [2025-03-04 01:39:45,006 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=85, Invalid=417, Unknown=4, NotChecked=0, Total=506 [2025-03-04 01:39:45,006 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 36 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:39:45,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 443 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 01:39:45,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-04 01:39:45,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 166. [2025-03-04 01:39:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 153 states have (on average 1.2679738562091503) internal successors, (194), 153 states have internal predecessors, (194), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:39:45,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 216 transitions. [2025-03-04 01:39:45,016 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 216 transitions. Word has length 115 [2025-03-04 01:39:45,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:39:45,016 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 216 transitions. [2025-03-04 01:39:45,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:39:45,016 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 216 transitions. [2025-03-04 01:39:45,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-04 01:39:45,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:39:45,017 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:39:45,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:39:45,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:45,218 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:39:45,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:39:45,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1824298735, now seen corresponding path program 1 times [2025-03-04 01:39:45,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:39:45,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971439322] [2025-03-04 01:39:45,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:39:45,218 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:39:45,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:39:45,220 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:39:45,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:39:45,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-04 01:39:45,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-04 01:39:45,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:39:45,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:39:45,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-04 01:39:45,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:39:45,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 01:39:45,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2025-03-04 01:39:45,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 22 [2025-03-04 01:39:46,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:46,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 55 [2025-03-04 01:39:46,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:46,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 65 [2025-03-04 01:39:48,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:48,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 126 treesize of output 78 [2025-03-04 01:39:55,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:39:55,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 136 treesize of output 91 [2025-03-04 01:40:06,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:06,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 140 treesize of output 94 [2025-03-04 01:40:06,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:06,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 135 treesize of output 104 [2025-03-04 01:40:06,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:06,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 207 treesize of output 132 [2025-03-04 01:40:07,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:07,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 177 treesize of output 123 [2025-03-04 01:40:07,378 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:07,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 216 treesize of output 78 [2025-03-04 01:40:07,456 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 88 proven. 96 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-04 01:40:07,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:40:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 01:40:07,749 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [971439322] [2025-03-04 01:40:07,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [971439322] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:07,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:40:07,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2025-03-04 01:40:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505829078] [2025-03-04 01:40:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:40:07,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:40:07,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:07,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:40:07,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=307, Unknown=6, NotChecked=0, Total=380 [2025-03-04 01:40:07,753 INFO L87 Difference]: Start difference. First operand 166 states and 216 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:40:08,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:40:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:40:09,357 INFO L93 Difference]: Finished difference Result 347 states and 451 transitions. [2025-03-04 01:40:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:40:09,358 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 115 [2025-03-04 01:40:09,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:40:09,359 INFO L225 Difference]: With dead ends: 347 [2025-03-04 01:40:09,359 INFO L226 Difference]: Without dead ends: 184 [2025-03-04 01:40:09,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=72, Invalid=342, Unknown=6, NotChecked=0, Total=420 [2025-03-04 01:40:09,360 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 40 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-04 01:40:09,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 328 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-04 01:40:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-04 01:40:09,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 166. [2025-03-04 01:40:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 153 states have (on average 1.2549019607843137) internal successors, (192), 153 states have internal predecessors, (192), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 01:40:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 214 transitions. [2025-03-04 01:40:09,366 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 214 transitions. Word has length 115 [2025-03-04 01:40:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:40:09,366 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 214 transitions. [2025-03-04 01:40:09,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-04 01:40:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 214 transitions. [2025-03-04 01:40:09,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 01:40:09,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:40:09,367 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:40:09,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:40:09,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:40:09,568 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:40:09,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:40:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2068589530, now seen corresponding path program 1 times [2025-03-04 01:40:09,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:40:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793442927] [2025-03-04 01:40:09,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:09,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:40:09,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:40:09,570 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:40:09,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-04 01:40:09,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:40:09,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:40:09,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:09,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:09,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:40:09,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:09,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 21 [2025-03-04 01:40:10,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 67 [2025-03-04 01:40:11,032 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:11,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 259 treesize of output 135 [2025-03-04 01:40:11,517 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:11,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 357 treesize of output 123 [2025-03-04 01:40:11,615 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 01:40:11,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:40:12,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:40:12,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793442927] [2025-03-04 01:40:12,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793442927] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:12,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1371940358] [2025-03-04 01:40:12,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:40:12,270 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:40:12,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:40:12,272 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:40:12,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-03-04 01:40:12,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 01:40:13,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 01:40:13,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:40:13,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:40:13,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-04 01:40:13,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:40:14,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-04 01:40:15,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 79 [2025-03-04 01:40:16,546 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:16,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 221 treesize of output 133 [2025-03-04 01:40:17,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:40:17,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 259 treesize of output 143 [2025-03-04 01:40:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 36 proven. 96 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2025-03-04 01:40:21,336 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:40:26,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1371940358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:40:26,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:40:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2025-03-04 01:40:26,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876838124] [2025-03-04 01:40:26,008 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:40:26,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 01:40:26,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:40:26,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 01:40:26,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=777, Unknown=3, NotChecked=0, Total=930 [2025-03-04 01:40:26,009 INFO L87 Difference]: Start difference. First operand 166 states and 214 transitions. Second operand has 24 states, 24 states have (on average 5.0) internal successors, (120), 23 states have internal predecessors, (120), 8 states have call successors, (22), 8 states have call predecessors, (22), 8 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2025-03-04 01:40:29,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-04 01:40:34,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0]