./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.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 0d3b5dee297a010530e733718cca08900e46ab18a4a35ca825ad2e8828fb51c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:43:28,611 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:43:28,665 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:43:28,671 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:43:28,672 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:43:28,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:43:28,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:43:28,691 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:43:28,691 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:43:28,691 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:43:28,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:43:28,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:43:28,692 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:43:28,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:43:28,693 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:43:28,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:43:28,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:43:28,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:43:28,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:43:28,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:43:28,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:43:28,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:43:28,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:43:28,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:43:28,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:43:28,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:43:28,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:43:28,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:43:28,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:43:28,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:43:28,695 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:43:28,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:43:28,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:43:28,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:43:28,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:43:28,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:43:28,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:43:28,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:43:28,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:43:28,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:43:28,696 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:43:28,696 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:43:28,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:43:28,696 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 -> 0d3b5dee297a010530e733718cca08900e46ab18a4a35ca825ad2e8828fb51c7 [2025-03-17 05:43:28,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:43:28,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:43:28,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:43:28,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:43:28,954 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:43:28,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2025-03-17 05:43:30,132 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6751dba9a/4c9c1ee3a3554db4a1d406920255815f/FLAG48e0d6306 [2025-03-17 05:43:30,355 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:43:30,356 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2025-03-17 05:43:30,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6751dba9a/4c9c1ee3a3554db4a1d406920255815f/FLAG48e0d6306 [2025-03-17 05:43:30,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6751dba9a/4c9c1ee3a3554db4a1d406920255815f [2025-03-17 05:43:30,410 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:43:30,411 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:43:30,413 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:43:30,413 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:43:30,418 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:43:30,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,419 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61bc8c13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30, skipping insertion in model container [2025-03-17 05:43:30,419 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:43:30,540 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-p_file-2.i[915,928] [2025-03-17 05:43:30,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:43:30,601 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:43:30,608 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-p_file-2.i[915,928] [2025-03-17 05:43:30,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:43:30,662 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:43:30,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30 WrapperNode [2025-03-17 05:43:30,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:43:30,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:43:30,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:43:30,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:43:30,670 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,707 INFO L138 Inliner]: procedures = 29, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 535 [2025-03-17 05:43:30,708 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:43:30,708 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:43:30,708 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:43:30,708 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:43:30,717 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,717 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,721 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,748 INFO L175 MemorySlicer]: Split 131 memory accesses to 11 slices as follows [2, 12, 14, 22, 16, 14, 12, 8, 7, 14, 10]. 17 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 1, 1, 4, 1, 3, 1, 1]. [2025-03-17 05:43:30,749 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,759 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,761 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,766 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,767 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:43:30,776 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:43:30,776 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:43:30,776 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:43:30,777 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (1/1) ... [2025-03-17 05:43:30,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:43:30,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:30,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:43:30,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:43:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:43:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:43:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:43:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:43:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:43:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:43:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:43:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:43:30,820 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:43:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:43:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:43:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:43:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:43:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:43:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:43:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:43:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:43:30,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:43:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:43:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:43:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:43:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:43:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:43:30,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:43:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:43:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:43:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:43:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:43:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:43:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:43:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:43:30,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:43:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:43:30,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:43:30,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:43:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:43:30,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:43:30,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:43:30,973 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:43:30,975 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:43:31,367 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem90#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~mem85#1;havoc property_#t~ite89#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~mem88#1;havoc property_#t~ite99#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite98#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~mem104#1;havoc property_#t~mem102#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~ite126#1;havoc property_#t~mem111#1;havoc property_#t~mem106#1;havoc property_#t~ite108#1;havoc property_#t~mem107#1;havoc property_#t~mem109#1;havoc property_#t~bitwise110#1;havoc property_#t~ite123#1;havoc property_#t~mem115#1;havoc property_#t~mem114#1;havoc property_#t~mem112#1;havoc property_#t~mem113#1;havoc property_#t~short116#1;havoc property_#t~ite121#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~mem122#1;havoc property_#t~mem125#1;havoc property_#t~mem124#1;havoc property_#t~short127#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite143#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~ite140#1;havoc property_#t~mem137#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~mem139#1;havoc property_#t~mem138#1;havoc property_#t~mem142#1;havoc property_#t~mem141#1;havoc property_#t~short144#1; [2025-03-17 05:43:31,404 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2025-03-17 05:43:31,404 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:43:31,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:43:31,418 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:43:31,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:31 BoogieIcfgContainer [2025-03-17 05:43:31,418 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:43:31,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:43:31,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:43:31,424 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:43:31,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:43:30" (1/3) ... [2025-03-17 05:43:31,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198d83d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:31, skipping insertion in model container [2025-03-17 05:43:31,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:30" (2/3) ... [2025-03-17 05:43:31,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@198d83d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:31, skipping insertion in model container [2025-03-17 05:43:31,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:31" (3/3) ... [2025-03-17 05:43:31,426 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-2.i [2025-03-17 05:43:31,437 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:43:31,438 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-2.i that has 2 procedures, 98 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:43:31,474 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:43:31,482 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;@4a6315dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:43:31,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:43:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand has 98 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 84 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:43:31,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:43:31,492 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:31,492 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:31,493 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:31,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:31,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2074996487, now seen corresponding path program 1 times [2025-03-17 05:43:31,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:31,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975803281] [2025-03-17 05:43:31,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:31,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:31,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:43:31,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:43:31,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:31,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:31,750 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:43:31,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:31,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975803281] [2025-03-17 05:43:31,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975803281] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:31,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433213084] [2025-03-17 05:43:31,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:31,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:31,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:31,755 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:43:31,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 05:43:31,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:43:31,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:43:31,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:31,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:31,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:43:31,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2025-03-17 05:43:31,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:43:31,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433213084] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:31,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:43:31,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:43:31,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697323397] [2025-03-17 05:43:31,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:31,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:43:31,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:31,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:43:31,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:43:31,997 INFO L87 Difference]: Start difference. First operand has 98 states, 83 states have (on average 1.4819277108433735) internal successors, (123), 84 states have internal predecessors, (123), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:43:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:32,028 INFO L93 Difference]: Finished difference Result 193 states and 304 transitions. [2025-03-17 05:43:32,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:43:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2025-03-17 05:43:32,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:32,035 INFO L225 Difference]: With dead ends: 193 [2025-03-17 05:43:32,036 INFO L226 Difference]: Without dead ends: 96 [2025-03-17 05:43:32,039 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:43:32,042 INFO L435 NwaCegarLoop]: 141 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, 141 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-17 05:43:32,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:32,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-17 05:43:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-17 05:43:32,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.451219512195122) internal successors, (119), 82 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:43:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 143 transitions. [2025-03-17 05:43:32,082 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 143 transitions. Word has length 96 [2025-03-17 05:43:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:32,083 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 143 transitions. [2025-03-17 05:43:32,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:43:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 143 transitions. [2025-03-17 05:43:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:43:32,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:32,086 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:32,095 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-17 05:43:32,287 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-17 05:43:32,287 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:32,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:32,288 INFO L85 PathProgramCache]: Analyzing trace with hash 295126493, now seen corresponding path program 1 times [2025-03-17 05:43:32,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:32,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470454746] [2025-03-17 05:43:32,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:32,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:32,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:43:32,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:43:32,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:32,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:32,670 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2025-03-17 05:43:32,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:32,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470454746] [2025-03-17 05:43:32,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470454746] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:32,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [632477184] [2025-03-17 05:43:32,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:32,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:32,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:32,674 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:43:32,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 05:43:32,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:43:32,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:43:32,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:32,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:32,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:43:32,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:32,881 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:43:32,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [632477184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:32,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:43:32,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-17 05:43:32,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185002207] [2025-03-17 05:43:32,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:32,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:43:32,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:32,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:43:32,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:43:32,884 INFO L87 Difference]: Start difference. First operand 96 states and 143 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:32,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:32,923 INFO L93 Difference]: Finished difference Result 193 states and 288 transitions. [2025-03-17 05:43:32,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:43:32,924 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-03-17 05:43:32,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:32,927 INFO L225 Difference]: With dead ends: 193 [2025-03-17 05:43:32,927 INFO L226 Difference]: Without dead ends: 98 [2025-03-17 05:43:32,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:43:32,928 INFO L435 NwaCegarLoop]: 139 mSDtfsCounter, 0 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 406 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-17 05:43:32,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 406 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:32,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-17 05:43:32,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-17 05:43:32,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:43:32,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 145 transitions. [2025-03-17 05:43:32,940 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 145 transitions. Word has length 96 [2025-03-17 05:43:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:32,941 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 145 transitions. [2025-03-17 05:43:32,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:32,942 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 145 transitions. [2025-03-17 05:43:32,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:43:32,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:32,944 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:32,950 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 05:43:33,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-17 05:43:33,144 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:33,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:33,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1093785586, now seen corresponding path program 1 times [2025-03-17 05:43:33,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:33,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635209560] [2025-03-17 05:43:33,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:33,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:33,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:43:33,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:43:33,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:33,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:33,290 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:33,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:33,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635209560] [2025-03-17 05:43:33,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635209560] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:33,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:33,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:43:33,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904881283] [2025-03-17 05:43:33,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:33,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:43:33,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:33,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:43:33,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:43:33,293 INFO L87 Difference]: Start difference. First operand 98 states and 145 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:33,352 INFO L93 Difference]: Finished difference Result 239 states and 355 transitions. [2025-03-17 05:43:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:43:33,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2025-03-17 05:43:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:33,355 INFO L225 Difference]: With dead ends: 239 [2025-03-17 05:43:33,356 INFO L226 Difference]: Without dead ends: 142 [2025-03-17 05:43:33,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:43:33,357 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 60 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:33,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 276 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:33,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2025-03-17 05:43:33,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 115. [2025-03-17 05:43:33,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 101 states have internal predecessors, (148), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:43:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2025-03-17 05:43:33,372 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 99 [2025-03-17 05:43:33,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:33,372 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2025-03-17 05:43:33,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:33,372 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2025-03-17 05:43:33,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:43:33,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:33,373 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:33,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:43:33,373 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:33,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:33,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1619378699, now seen corresponding path program 1 times [2025-03-17 05:43:33,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:33,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339385801] [2025-03-17 05:43:33,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:33,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:33,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:43:33,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:43:33,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:33,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:33,970 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:33,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:33,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339385801] [2025-03-17 05:43:33,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339385801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:33,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:33,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:43:33,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969011852] [2025-03-17 05:43:33,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:33,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:43:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:33,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:43:33,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:43:33,976 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:34,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:34,124 INFO L93 Difference]: Finished difference Result 290 states and 428 transitions. [2025-03-17 05:43:34,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:43:34,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 99 [2025-03-17 05:43:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:34,127 INFO L225 Difference]: With dead ends: 290 [2025-03-17 05:43:34,127 INFO L226 Difference]: Without dead ends: 176 [2025-03-17 05:43:34,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:43:34,129 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 64 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:34,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 624 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:34,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2025-03-17 05:43:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2025-03-17 05:43:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 156 states have (on average 1.4487179487179487) internal successors, (226), 157 states have internal predecessors, (226), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-17 05:43:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 254 transitions. [2025-03-17 05:43:34,148 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 254 transitions. Word has length 99 [2025-03-17 05:43:34,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:34,149 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 254 transitions. [2025-03-17 05:43:34,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:34,150 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 254 transitions. [2025-03-17 05:43:34,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:43:34,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:34,152 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:34,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:43:34,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:34,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:34,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2070763732, now seen corresponding path program 1 times [2025-03-17 05:43:34,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:34,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233873978] [2025-03-17 05:43:34,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:34,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:34,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:43:34,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:43:34,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:34,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:43:34,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [137167823] [2025-03-17 05:43:34,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:34,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:34,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:34,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:43:34,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 05:43:34,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:43:34,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:43:34,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:34,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:34,435 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:43:34,438 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:34,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:43:34,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:34,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233873978] [2025-03-17 05:43:34,555 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:43:34,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [137167823] [2025-03-17 05:43:34,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [137167823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:34,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:34,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:43:34,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362794536] [2025-03-17 05:43:34,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:34,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:43:34,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:34,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:43:34,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:43:34,556 INFO L87 Difference]: Start difference. First operand 173 states and 254 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:34,638 INFO L93 Difference]: Finished difference Result 483 states and 712 transitions. [2025-03-17 05:43:34,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:43:34,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 101 [2025-03-17 05:43:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:34,641 INFO L225 Difference]: With dead ends: 483 [2025-03-17 05:43:34,641 INFO L226 Difference]: Without dead ends: 311 [2025-03-17 05:43:34,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:43:34,643 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 134 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:34,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 401 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-17 05:43:34,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 242. [2025-03-17 05:43:34,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 212 states have (on average 1.4339622641509433) internal successors, (304), 213 states have internal predecessors, (304), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:43:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 356 transitions. [2025-03-17 05:43:34,667 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 356 transitions. Word has length 101 [2025-03-17 05:43:34,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:34,668 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 356 transitions. [2025-03-17 05:43:34,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:34,669 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 356 transitions. [2025-03-17 05:43:34,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:43:34,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:34,670 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:34,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 05:43:34,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:34,871 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:34,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:34,871 INFO L85 PathProgramCache]: Analyzing trace with hash -602106068, now seen corresponding path program 1 times [2025-03-17 05:43:34,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:34,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378779997] [2025-03-17 05:43:34,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:34,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:34,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:43:34,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:43:34,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:34,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:35,487 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:35,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:35,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378779997] [2025-03-17 05:43:35,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378779997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:35,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:35,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:43:35,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656420403] [2025-03-17 05:43:35,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:35,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:43:35,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:35,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:43:35,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:43:35,488 INFO L87 Difference]: Start difference. First operand 242 states and 356 transitions. Second operand has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:35,932 INFO L93 Difference]: Finished difference Result 662 states and 958 transitions. [2025-03-17 05:43:35,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:35,932 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 102 [2025-03-17 05:43:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:35,935 INFO L225 Difference]: With dead ends: 662 [2025-03-17 05:43:35,935 INFO L226 Difference]: Without dead ends: 490 [2025-03-17 05:43:35,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:43:35,937 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 550 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 769 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:35,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 769 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:35,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-17 05:43:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 411. [2025-03-17 05:43:35,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 372 states have (on average 1.4381720430107527) internal successors, (535), 375 states have internal predecessors, (535), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:43:35,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 599 transitions. [2025-03-17 05:43:35,967 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 599 transitions. Word has length 102 [2025-03-17 05:43:35,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:35,967 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 599 transitions. [2025-03-17 05:43:35,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:35,967 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 599 transitions. [2025-03-17 05:43:35,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:43:35,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:35,968 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:35,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:43:35,969 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:35,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1895909869, now seen corresponding path program 1 times [2025-03-17 05:43:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:35,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135317598] [2025-03-17 05:43:35,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:35,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:35,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:43:36,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:43:36,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:36,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:36,495 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:36,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:36,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135317598] [2025-03-17 05:43:36,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1135317598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:36,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:36,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-17 05:43:36,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350316212] [2025-03-17 05:43:36,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:36,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 05:43:36,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:36,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 05:43:36,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-17 05:43:36,496 INFO L87 Difference]: Start difference. First operand 411 states and 599 transitions. Second operand has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:43:36,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:36,852 INFO L93 Difference]: Finished difference Result 710 states and 1029 transitions. [2025-03-17 05:43:36,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 05:43:36,852 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 102 [2025-03-17 05:43:36,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:36,854 INFO L225 Difference]: With dead ends: 710 [2025-03-17 05:43:36,854 INFO L226 Difference]: Without dead ends: 401 [2025-03-17 05:43:36,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:43:36,855 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 535 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:36,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 755 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2025-03-17 05:43:36,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 369. [2025-03-17 05:43:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 331 states have (on average 1.4290030211480362) internal successors, (473), 333 states have internal predecessors, (473), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:43:36,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 533 transitions. [2025-03-17 05:43:36,880 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 533 transitions. Word has length 102 [2025-03-17 05:43:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:36,881 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 533 transitions. [2025-03-17 05:43:36,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 5.0) internal successors, (45), 10 states have internal predecessors, (45), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:43:36,881 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 533 transitions. [2025-03-17 05:43:36,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:43:36,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:36,882 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:36,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:43:36,882 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:36,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:36,883 INFO L85 PathProgramCache]: Analyzing trace with hash -390755155, now seen corresponding path program 1 times [2025-03-17 05:43:36,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:36,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117365451] [2025-03-17 05:43:36,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:36,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:36,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:43:36,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:43:36,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:36,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:37,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:37,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117365451] [2025-03-17 05:43:37,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117365451] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:37,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:37,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:43:37,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80668888] [2025-03-17 05:43:37,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:37,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:43:37,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:37,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:43:37,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:43:37,419 INFO L87 Difference]: Start difference. First operand 369 states and 533 transitions. Second operand has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:37,841 INFO L93 Difference]: Finished difference Result 710 states and 1019 transitions. [2025-03-17 05:43:37,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:37,842 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 102 [2025-03-17 05:43:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:37,844 INFO L225 Difference]: With dead ends: 710 [2025-03-17 05:43:37,844 INFO L226 Difference]: Without dead ends: 447 [2025-03-17 05:43:37,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:43:37,845 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 264 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:37,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 707 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-03-17 05:43:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 375. [2025-03-17 05:43:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 337 states have (on average 1.4213649851632046) internal successors, (479), 339 states have internal predecessors, (479), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:43:37,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 539 transitions. [2025-03-17 05:43:37,866 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 539 transitions. Word has length 102 [2025-03-17 05:43:37,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:37,866 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 539 transitions. [2025-03-17 05:43:37,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.625) internal successors, (45), 9 states have internal predecessors, (45), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:37,867 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 539 transitions. [2025-03-17 05:43:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:43:37,867 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:37,867 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:37,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:43:37,868 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:37,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:37,868 INFO L85 PathProgramCache]: Analyzing trace with hash 2107260782, now seen corresponding path program 1 times [2025-03-17 05:43:37,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:37,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957574984] [2025-03-17 05:43:37,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:37,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:37,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:43:37,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:43:37,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:37,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:38,254 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:38,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:38,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957574984] [2025-03-17 05:43:38,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957574984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:38,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:38,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:43:38,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034173033] [2025-03-17 05:43:38,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:38,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:43:38,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:38,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:43:38,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:43:38,255 INFO L87 Difference]: Start difference. First operand 375 states and 539 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:38,474 INFO L93 Difference]: Finished difference Result 854 states and 1235 transitions. [2025-03-17 05:43:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:43:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2025-03-17 05:43:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:38,477 INFO L225 Difference]: With dead ends: 854 [2025-03-17 05:43:38,478 INFO L226 Difference]: Without dead ends: 585 [2025-03-17 05:43:38,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:43:38,479 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 80 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:38,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 937 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:38,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-17 05:43:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 487. [2025-03-17 05:43:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 449 states have (on average 1.44543429844098) internal successors, (649), 451 states have internal predecessors, (649), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:43:38,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 709 transitions. [2025-03-17 05:43:38,507 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 709 transitions. Word has length 102 [2025-03-17 05:43:38,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:38,508 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 709 transitions. [2025-03-17 05:43:38,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:38,508 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 709 transitions. [2025-03-17 05:43:38,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:43:38,509 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:38,509 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:38,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 05:43:38,509 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:38,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1911678837, now seen corresponding path program 1 times [2025-03-17 05:43:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:38,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954846614] [2025-03-17 05:43:38,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:38,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:38,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:43:38,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:43:38,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:38,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:38,919 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:38,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:38,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954846614] [2025-03-17 05:43:38,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954846614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:38,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:38,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 05:43:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075394119] [2025-03-17 05:43:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:38,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:43:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:38,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:43:38,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:43:38,921 INFO L87 Difference]: Start difference. First operand 487 states and 709 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:39,238 INFO L93 Difference]: Finished difference Result 854 states and 1243 transitions. [2025-03-17 05:43:39,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:39,239 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 104 [2025-03-17 05:43:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:39,241 INFO L225 Difference]: With dead ends: 854 [2025-03-17 05:43:39,241 INFO L226 Difference]: Without dead ends: 523 [2025-03-17 05:43:39,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:43:39,242 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 221 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:39,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 932 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-17 05:43:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 487. [2025-03-17 05:43:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 449 states have (on average 1.44097995545657) internal successors, (647), 451 states have internal predecessors, (647), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:43:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 707 transitions. [2025-03-17 05:43:39,260 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 707 transitions. Word has length 104 [2025-03-17 05:43:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:39,260 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 707 transitions. [2025-03-17 05:43:39,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 10 states have internal predecessors, (47), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 707 transitions. [2025-03-17 05:43:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:43:39,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:39,262 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:39,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:43:39,262 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:39,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:39,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1624553067, now seen corresponding path program 1 times [2025-03-17 05:43:39,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:39,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963354801] [2025-03-17 05:43:39,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:39,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:39,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:43:39,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:43:39,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:39,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:39,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963354801] [2025-03-17 05:43:39,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963354801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:39,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:39,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 05:43:39,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926247405] [2025-03-17 05:43:39,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:39,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 05:43:39,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:39,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 05:43:39,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:43:39,899 INFO L87 Difference]: Start difference. First operand 487 states and 707 transitions. Second operand has 12 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:43:40,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:40,323 INFO L93 Difference]: Finished difference Result 932 states and 1352 transitions. [2025-03-17 05:43:40,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 05:43:40,324 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 104 [2025-03-17 05:43:40,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:40,326 INFO L225 Difference]: With dead ends: 932 [2025-03-17 05:43:40,327 INFO L226 Difference]: Without dead ends: 597 [2025-03-17 05:43:40,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:43:40,328 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 249 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 860 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:40,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 860 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:40,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-03-17 05:43:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 519. [2025-03-17 05:43:40,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 481 states have (on average 1.4407484407484408) internal successors, (693), 483 states have internal predecessors, (693), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:43:40,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 753 transitions. [2025-03-17 05:43:40,352 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 753 transitions. Word has length 104 [2025-03-17 05:43:40,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:40,352 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 753 transitions. [2025-03-17 05:43:40,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 4.7) internal successors, (47), 11 states have internal predecessors, (47), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:43:40,353 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 753 transitions. [2025-03-17 05:43:40,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:43:40,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:40,354 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:40,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:43:40,354 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:40,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1835903980, now seen corresponding path program 1 times [2025-03-17 05:43:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776091871] [2025-03-17 05:43:40,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:40,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:40,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:43:40,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:43:40,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:40,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:40,714 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:40,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:40,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776091871] [2025-03-17 05:43:40,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776091871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:40,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:40,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:43:40,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537868550] [2025-03-17 05:43:40,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:40,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:43:40,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:40,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:43:40,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:43:40,716 INFO L87 Difference]: Start difference. First operand 519 states and 753 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:40,902 INFO L93 Difference]: Finished difference Result 902 states and 1308 transitions. [2025-03-17 05:43:40,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:43:40,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:43:40,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:40,906 INFO L225 Difference]: With dead ends: 902 [2025-03-17 05:43:40,906 INFO L226 Difference]: Without dead ends: 555 [2025-03-17 05:43:40,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:43:40,907 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 70 mSDsluCounter, 841 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:40,907 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 1043 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2025-03-17 05:43:40,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 519. [2025-03-17 05:43:40,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 481 states have (on average 1.4365904365904365) internal successors, (691), 483 states have internal predecessors, (691), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:43:40,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 751 transitions. [2025-03-17 05:43:40,927 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 751 transitions. Word has length 104 [2025-03-17 05:43:40,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:40,928 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 751 transitions. [2025-03-17 05:43:40,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 751 transitions. [2025-03-17 05:43:40,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:43:40,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:40,929 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:40,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:43:40,929 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:40,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:40,930 INFO L85 PathProgramCache]: Analyzing trace with hash -367699692, now seen corresponding path program 1 times [2025-03-17 05:43:40,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:40,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145951421] [2025-03-17 05:43:40,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:40,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:40,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:43:40,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:43:40,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:40,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:41,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:41,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:41,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145951421] [2025-03-17 05:43:41,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145951421] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:41,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:41,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:43:41,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448706518] [2025-03-17 05:43:41,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:41,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:43:41,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:41,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:43:41,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:43:41,241 INFO L87 Difference]: Start difference. First operand 519 states and 751 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:41,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:41,490 INFO L93 Difference]: Finished difference Result 1046 states and 1493 transitions. [2025-03-17 05:43:41,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:43:41,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:43:41,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:41,493 INFO L225 Difference]: With dead ends: 1046 [2025-03-17 05:43:41,493 INFO L226 Difference]: Without dead ends: 699 [2025-03-17 05:43:41,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:43:41,494 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 147 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:41,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 770 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:41,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2025-03-17 05:43:41,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 539. [2025-03-17 05:43:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 501 states have (on average 1.43313373253493) internal successors, (718), 503 states have internal predecessors, (718), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:43:41,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 778 transitions. [2025-03-17 05:43:41,522 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 778 transitions. Word has length 105 [2025-03-17 05:43:41,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:41,522 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 778 transitions. [2025-03-17 05:43:41,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:41,523 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 778 transitions. [2025-03-17 05:43:41,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:43:41,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:41,524 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:41,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 05:43:41,524 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:41,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash 2130316245, now seen corresponding path program 1 times [2025-03-17 05:43:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:41,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674805847] [2025-03-17 05:43:41,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:41,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:43:41,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:43:41,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:41,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:41,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:41,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674805847] [2025-03-17 05:43:41,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674805847] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:41,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:41,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:43:41,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51917939] [2025-03-17 05:43:41,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:41,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:43:41,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:41,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:43:41,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:43:41,930 INFO L87 Difference]: Start difference. First operand 539 states and 778 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:42,312 INFO L93 Difference]: Finished difference Result 934 states and 1341 transitions. [2025-03-17 05:43:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:43:42,313 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 105 [2025-03-17 05:43:42,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:42,315 INFO L225 Difference]: With dead ends: 934 [2025-03-17 05:43:42,315 INFO L226 Difference]: Without dead ends: 569 [2025-03-17 05:43:42,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:43:42,316 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 371 mSDsluCounter, 652 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:42,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 822 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:43:42,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2025-03-17 05:43:42,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 526. [2025-03-17 05:43:42,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 488 states have (on average 1.4241803278688525) internal successors, (695), 490 states have internal predecessors, (695), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:43:42,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 755 transitions. [2025-03-17 05:43:42,339 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 755 transitions. Word has length 105 [2025-03-17 05:43:42,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:42,341 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 755 transitions. [2025-03-17 05:43:42,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:42,341 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 755 transitions. [2025-03-17 05:43:42,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:43:42,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:42,342 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:42,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 05:43:42,342 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:42,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash -692560503, now seen corresponding path program 1 times [2025-03-17 05:43:42,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:42,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202260558] [2025-03-17 05:43:42,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:42,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:42,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:43:42,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:43:42,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:42,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:42,584 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:42,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:42,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202260558] [2025-03-17 05:43:42,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202260558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:42,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:42,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:43:42,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733969383] [2025-03-17 05:43:42,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:42,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:43:42,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:42,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:43:42,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:43:42,585 INFO L87 Difference]: Start difference. First operand 526 states and 755 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:42,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:42,721 INFO L93 Difference]: Finished difference Result 960 states and 1367 transitions. [2025-03-17 05:43:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:43:42,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-03-17 05:43:42,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:42,724 INFO L225 Difference]: With dead ends: 960 [2025-03-17 05:43:42,724 INFO L226 Difference]: Without dead ends: 608 [2025-03-17 05:43:42,725 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:43:42,725 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 55 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:42,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 615 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:42,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2025-03-17 05:43:42,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 533. [2025-03-17 05:43:42,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 495 states have (on average 1.4202020202020202) internal successors, (703), 497 states have internal predecessors, (703), 30 states have call successors, (30), 7 states have call predecessors, (30), 7 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-17 05:43:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 763 transitions. [2025-03-17 05:43:42,750 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 763 transitions. Word has length 106 [2025-03-17 05:43:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:42,750 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 763 transitions. [2025-03-17 05:43:42,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 763 transitions. [2025-03-17 05:43:42,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:43:42,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:42,752 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:42,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 05:43:42,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:42,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:42,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1805455434, now seen corresponding path program 1 times [2025-03-17 05:43:42,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:42,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450960449] [2025-03-17 05:43:42,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:42,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:42,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:43:42,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:43:42,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:42,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:43,857 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:43,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:43,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450960449] [2025-03-17 05:43:43,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450960449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:43,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:43,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-17 05:43:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444831243] [2025-03-17 05:43:43,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:43,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:43:43,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:43,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:43:43,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:43:43,859 INFO L87 Difference]: Start difference. First operand 533 states and 763 transitions. Second operand has 18 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 17 states have internal predecessors, (49), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-17 05:43:44,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:44,894 INFO L93 Difference]: Finished difference Result 1126 states and 1595 transitions. [2025-03-17 05:43:44,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 05:43:44,895 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 17 states have internal predecessors, (49), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) Word has length 106 [2025-03-17 05:43:44,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:44,898 INFO L225 Difference]: With dead ends: 1126 [2025-03-17 05:43:44,898 INFO L226 Difference]: Without dead ends: 769 [2025-03-17 05:43:44,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=944, Unknown=0, NotChecked=0, Total=1122 [2025-03-17 05:43:44,900 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 459 mSDsluCounter, 1728 mSDsCounter, 0 mSdLazyCounter, 1103 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:44,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 1905 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1103 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:43:44,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2025-03-17 05:43:44,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 750. [2025-03-17 05:43:44,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 698 states have (on average 1.4025787965616046) internal successors, (979), 702 states have internal predecessors, (979), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:43:44,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1059 transitions. [2025-03-17 05:43:44,936 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1059 transitions. Word has length 106 [2025-03-17 05:43:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:44,936 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1059 transitions. [2025-03-17 05:43:44,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 3.2666666666666666) internal successors, (49), 17 states have internal predecessors, (49), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-17 05:43:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1059 transitions. [2025-03-17 05:43:44,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:43:44,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:44,938 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:44,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 05:43:44,938 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:44,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:44,939 INFO L85 PathProgramCache]: Analyzing trace with hash 444549174, now seen corresponding path program 1 times [2025-03-17 05:43:44,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:44,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365538254] [2025-03-17 05:43:44,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:44,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:44,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:43:44,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:43:44,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:44,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:46,174 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:46,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:46,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365538254] [2025-03-17 05:43:46,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365538254] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:46,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:46,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:43:46,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930898195] [2025-03-17 05:43:46,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:46,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:43:46,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:46,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:43:46,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:43:46,176 INFO L87 Difference]: Start difference. First operand 750 states and 1059 transitions. Second operand has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:43:47,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:47,249 INFO L93 Difference]: Finished difference Result 1334 states and 1884 transitions. [2025-03-17 05:43:47,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:43:47,250 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 107 [2025-03-17 05:43:47,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:47,253 INFO L225 Difference]: With dead ends: 1334 [2025-03-17 05:43:47,254 INFO L226 Difference]: Without dead ends: 798 [2025-03-17 05:43:47,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:43:47,255 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 235 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 974 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:47,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 974 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-17 05:43:47,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-17 05:43:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 752. [2025-03-17 05:43:47,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 700 states have (on average 1.4014285714285715) internal successors, (981), 704 states have internal predecessors, (981), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:43:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 1061 transitions. [2025-03-17 05:43:47,292 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 1061 transitions. Word has length 107 [2025-03-17 05:43:47,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:47,292 INFO L471 AbstractCegarLoop]: Abstraction has 752 states and 1061 transitions. [2025-03-17 05:43:47,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:43:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 1061 transitions. [2025-03-17 05:43:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:43:47,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:47,293 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:47,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 05:43:47,294 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:47,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:47,294 INFO L85 PathProgramCache]: Analyzing trace with hash 151146167, now seen corresponding path program 1 times [2025-03-17 05:43:47,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:47,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870420722] [2025-03-17 05:43:47,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:47,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:47,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:43:47,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:43:47,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:47,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:47,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:47,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870420722] [2025-03-17 05:43:47,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870420722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:47,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:47,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-17 05:43:47,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536936762] [2025-03-17 05:43:47,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:47,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:43:47,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:47,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:43:47,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:43:47,642 INFO L87 Difference]: Start difference. First operand 752 states and 1061 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:47,915 INFO L93 Difference]: Finished difference Result 1290 states and 1818 transitions. [2025-03-17 05:43:47,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:43:47,917 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2025-03-17 05:43:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:47,920 INFO L225 Difference]: With dead ends: 1290 [2025-03-17 05:43:47,920 INFO L226 Difference]: Without dead ends: 752 [2025-03-17 05:43:47,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:43:47,921 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 248 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:47,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 617 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-17 05:43:47,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 750. [2025-03-17 05:43:47,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 698 states have (on average 1.3911174785100286) internal successors, (971), 702 states have internal predecessors, (971), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:43:47,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1051 transitions. [2025-03-17 05:43:47,956 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1051 transitions. Word has length 107 [2025-03-17 05:43:47,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:47,956 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1051 transitions. [2025-03-17 05:43:47,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-17 05:43:47,957 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1051 transitions. [2025-03-17 05:43:47,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:43:47,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:47,958 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:47,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 05:43:47,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:47,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash -937532036, now seen corresponding path program 1 times [2025-03-17 05:43:47,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:47,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634860464] [2025-03-17 05:43:47,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:47,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:47,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:43:47,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:43:47,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:47,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:48,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:48,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:43:48,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634860464] [2025-03-17 05:43:48,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634860464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:48,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:48,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-17 05:43:48,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354814314] [2025-03-17 05:43:48,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:48,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-17 05:43:48,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:43:48,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-17 05:43:48,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:43:48,477 INFO L87 Difference]: Start difference. First operand 750 states and 1051 transitions. Second operand has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:43:49,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:49,085 INFO L93 Difference]: Finished difference Result 1322 states and 1850 transitions. [2025-03-17 05:43:49,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:43:49,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 107 [2025-03-17 05:43:49,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:49,088 INFO L225 Difference]: With dead ends: 1322 [2025-03-17 05:43:49,088 INFO L226 Difference]: Without dead ends: 786 [2025-03-17 05:43:49,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:43:49,091 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 321 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:49,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 1186 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:43:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2025-03-17 05:43:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 750. [2025-03-17 05:43:49,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 750 states, 698 states have (on average 1.3853868194842407) internal successors, (967), 702 states have internal predecessors, (967), 40 states have call successors, (40), 11 states have call predecessors, (40), 11 states have return successors, (40), 36 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-17 05:43:49,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 1047 transitions. [2025-03-17 05:43:49,132 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 1047 transitions. Word has length 107 [2025-03-17 05:43:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:49,132 INFO L471 AbstractCegarLoop]: Abstraction has 750 states and 1047 transitions. [2025-03-17 05:43:49,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2025-03-17 05:43:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1047 transitions. [2025-03-17 05:43:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:43:49,134 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:49,134 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:49,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 05:43:49,134 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:49,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:49,135 INFO L85 PathProgramCache]: Analyzing trace with hash 670171195, now seen corresponding path program 1 times [2025-03-17 05:43:49,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:43:49,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758692934] [2025-03-17 05:43:49,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:49,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:43:49,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:43:49,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:43:49,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:49,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:43:49,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946455642] [2025-03-17 05:43:49,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:49,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:49,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:49,190 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 05:43:49,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 05:43:49,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:43:49,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:43:49,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:49,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:43:49,473 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:43:49,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:43:49,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:43:49,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:49,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:43:49,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:43:49,663 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:43:49,665 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:43:49,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:43:49,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:43:49,870 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:49,991 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:43:49,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:43:49 BoogieIcfgContainer [2025-03-17 05:43:49,994 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:43:49,994 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:43:49,994 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:43:49,994 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:43:49,995 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:31" (3/4) ... [2025-03-17 05:43:49,996 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:43:49,997 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:43:49,998 INFO L158 Benchmark]: Toolchain (without parser) took 19586.36ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 106.4MB in the beginning and 477.7MB in the end (delta: -371.3MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2025-03-17 05:43:49,998 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:43:49,998 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.49ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 91.5MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 05:43:49,998 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.43ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:43:49,999 INFO L158 Benchmark]: Boogie Preprocessor took 64.11ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 83.1MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:43:49,999 INFO L158 Benchmark]: IcfgBuilder took 642.20ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 43.9MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:43:49,999 INFO L158 Benchmark]: TraceAbstraction took 18573.07ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 43.5MB in the beginning and 477.9MB in the end (delta: -434.4MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2025-03-17 05:43:49,999 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 629.1MB. Free memory was 477.9MB in the beginning and 477.7MB in the end (delta: 203.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:43:50,000 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.49ms. Allocated memory is still 142.6MB. Free memory was 106.4MB in the beginning and 91.5MB in the end (delta: 14.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.43ms. Allocated memory is still 142.6MB. Free memory was 91.5MB in the beginning and 88.0MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.11ms. Allocated memory is still 142.6MB. Free memory was 88.0MB in the beginning and 83.1MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 642.20ms. Allocated memory is still 142.6MB. Free memory was 83.1MB in the beginning and 43.9MB in the end (delta: 39.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18573.07ms. Allocated memory was 142.6MB in the beginning and 629.1MB in the end (delta: 486.5MB). Free memory was 43.5MB in the beginning and 477.9MB in the end (delta: -434.4MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 629.1MB. Free memory was 477.9MB in the beginning and 477.7MB in the end (delta: 203.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 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 someBinaryFLOATComparisonOperation at line 92, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 90, overapproximation of someBinaryFLOATComparisonOperation at line 92, overapproximation of someUnaryDOUBLEoperation at line 36. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L22] unsigned short int var_1_1 = 10; [L23] unsigned short int* var_1_1_Pointer = &(var_1_1); [L24] unsigned short int var_1_5 = 200; [L24] unsigned short int var_1_5 = 200; [L25] unsigned short int* var_1_5_Pointer = &(var_1_5); [L26] unsigned short int var_1_6 = 56955; [L26] unsigned short int var_1_6 = 56955; [L27] unsigned short int* var_1_6_Pointer = &(var_1_6); [L28] unsigned short int var_1_7 = 32; [L28] unsigned short int var_1_7 = 32; [L29] unsigned short int* var_1_7_Pointer = &(var_1_7); [L30] unsigned short int var_1_8 = 1; [L30] unsigned short int var_1_8 = 1; [L31] unsigned short int* var_1_8_Pointer = &(var_1_8); [L32] unsigned short int var_1_9 = 8; [L32] unsigned short int var_1_9 = 8; [L33] unsigned short int* var_1_9_Pointer = &(var_1_9); [L34] unsigned char var_1_10 = 1; [L34] unsigned char var_1_10 = 1; [L35] unsigned char* var_1_10_Pointer = &(var_1_10); [L36] float var_1_11 = -0.6; [L36] float var_1_11 = -0.6; [L37] float* var_1_11_Pointer = &(var_1_11); [L38] float var_1_12 = 9.125; [L38] float var_1_12 = 9.125; [L39] float* var_1_12_Pointer = &(var_1_12); [L40] float var_1_13 = 50.5; [L40] float var_1_13 = 50.5; [L41] float* var_1_13_Pointer = &(var_1_13); [L42] unsigned short int last_1_var_1_1 = 10; [L43] unsigned short int last_1_var_1_9 = 8; [L103] isInitial = 1 [L104] FCALL initially() [L105] COND TRUE 1 [L106] CALL updateLastVariables() [L95] EXPR \read(var_1_1) [L95] last_1_var_1_1 = var_1_1 [L96] EXPR \read(var_1_9) [L96] last_1_var_1_9 = var_1_9 [L106] RET updateLastVariables() [L107] CALL updateVariables() [L74] var_1_5 = __VERIFIER_nondet_ushort() [L75] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L75] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L75] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L76] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L77] var_1_6 = __VERIFIER_nondet_ushort() [L78] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L78] CALL assume_abort_if_not(var_1_6 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L78] RET assume_abort_if_not(var_1_6 >= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] CALL assume_abort_if_not(var_1_6 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L79] RET assume_abort_if_not(var_1_6 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L80] var_1_7 = __VERIFIER_nondet_ushort() [L81] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L81] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L81] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L82] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L83] var_1_8 = __VERIFIER_nondet_ushort() [L84] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L84] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L85] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L86] var_1_10 = __VERIFIER_nondet_uchar() [L87] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L87] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L88] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L89] var_1_12 = __VERIFIER_nondet_float() [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F [L90] EXPR \read(var_1_12) [L90] EXPR var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] EXPR (var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L90] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L91] var_1_13 = __VERIFIER_nondet_float() [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L92] EXPR \read(var_1_13) [L92] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L92] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L107] RET updateVariables() [L108] CALL step() [L47] COND TRUE last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1) [L48] EXPR \read(*var_1_5_Pointer) [L48] EXPR \read(*var_1_6_Pointer) [L48] EXPR \read(*var_1_7_Pointer) [L48] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L48] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) [L48] EXPR \read(*var_1_8_Pointer) [L48] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L48] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) [L48] EXPR \read(*var_1_5_Pointer) [L48] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L48] (*(var_1_1_Pointer)) = (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))) [L50] EXPR \read(*var_1_10_Pointer) [L50] (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) [L50] EXPR \read(*var_1_6_Pointer) [L50] EXPR \read(*var_1_8_Pointer) [L50] (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L50] COND FALSE !((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) [L61] EXPR \read(*var_1_6_Pointer) [L61] (*(var_1_9_Pointer)) = (*(var_1_6_Pointer)) [L63] EXPR \read(*var_1_7_Pointer) [L63] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L63] COND FALSE !((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) [L70] EXPR \read(*var_1_12_Pointer) [L70] (*(var_1_11_Pointer)) = (*(var_1_12_Pointer)) [L108] RET step() [L109] CALL, EXPR property() [L99] EXPR (last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1 [L99] EXPR \read(*var_1_1_Pointer) [L99] EXPR \read(*var_1_5_Pointer) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR \read(*var_1_7_Pointer) [L99] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) [L99] EXPR \read(*var_1_8_Pointer) [L99] EXPR ((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) [L99] EXPR \read(*var_1_5_Pointer) [L99] EXPR (((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1 VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer))))) [L99] EXPR \read(*var_1_10_Pointer) [L99] EXPR (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR \read(*var_1_8_Pointer) [L99] EXPR (*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) [L99] EXPR \read(*var_1_9_Pointer) [L99] EXPR \read(*var_1_6_Pointer) [L99] EXPR ((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) [L99] EXPR \read(*var_1_7_Pointer) [L99] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR ((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) [L99] EXPR \read(*var_1_11_Pointer) [L99] EXPR \read(*var_1_12_Pointer) [L99] EXPR ((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99] EXPR (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L99-L100] return (((last_1_var_1_9 <= (last_1_var_1_9 * last_1_var_1_1)) ? ((*(var_1_1_Pointer)) == ((unsigned short int) (((((*(var_1_5_Pointer))) > (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer))))))) ? ((*(var_1_5_Pointer))) : (((((((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) > ((*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) - (*(var_1_7_Pointer)))) : ((*(var_1_8_Pointer)))))))))) : 1) && (((*(var_1_10_Pointer)) || ((*(var_1_6_Pointer)) == (*(var_1_8_Pointer)))) ? (((*(var_1_6_Pointer)) <= (((((0) < ((*(var_1_1_Pointer)))) ? (0) : ((*(var_1_1_Pointer))))) << (*(var_1_1_Pointer)))) ? (((*(var_1_10_Pointer)) && ((*(var_1_1_Pointer)) == ((*(var_1_6_Pointer)) * (*(var_1_5_Pointer))))) ? ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer)))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_5_Pointer))))) : ((*(var_1_9_Pointer)) == ((unsigned short int) 2))) : ((*(var_1_9_Pointer)) == ((unsigned short int) (*(var_1_6_Pointer)))))) && (((*(var_1_7_Pointer)) != (*(var_1_6_Pointer))) ? (((*(var_1_7_Pointer)) <= (*(var_1_9_Pointer))) ? ((*(var_1_11_Pointer)) == ((float) (((((*(var_1_12_Pointer))) > ((*(var_1_13_Pointer)))) ? ((*(var_1_12_Pointer))) : ((*(var_1_13_Pointer))))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) : ((*(var_1_11_Pointer)) == ((float) (*(var_1_12_Pointer))))) ; [L109] RET, EXPR property() [L109] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=10, last_1_var_1_9=8, var_1_10={10:0}, var_1_10_Pointer={10:0}, var_1_11={11:0}, var_1_11_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_5={5:0}, var_1_5_Pointer={5:0}, var_1_6={6:0}, var_1_6_Pointer={6:0}, var_1_7={7:0}, var_1_7_Pointer={7:0}, var_1_8={8:0}, var_1_8_Pointer={8:0}, var_1_9={9:0}, var_1_9_Pointer={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 98 locations, 159 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 20, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4063 SdHoareTripleChecker+Valid, 4.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4063 mSDsluCounter, 14740 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11903 mSDsCounter, 259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5845 IncrementalHoareTripleChecker+Invalid, 6104 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 259 mSolverCounterUnsat, 2837 mSDtfsCounter, 5845 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 589 GetRequests, 372 SyntacticMatches, 3 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=752occurred in iteration=17, InterpolantAutomatonStates: 152, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 911 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 2461 NumberOfCodeBlocks, 2461 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 2125 ConstructedInterpolants, 0 QuantifiedInterpolants, 10417 SizeOfPredicates, 3 NumberOfNonLiveVariables, 1296 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 5489/5544 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-17 05:43:50,044 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-p_file-2.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 0d3b5dee297a010530e733718cca08900e46ab18a4a35ca825ad2e8828fb51c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:43:51,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:43:51,999 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:43:52,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:43:52,007 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:43:52,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:43:52,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:43:52,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:43:52,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:43:52,029 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:43:52,029 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:43:52,029 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:43:52,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:43:52,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:43:52,029 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:43:52,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:43:52,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:43:52,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:43:52,031 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:43:52,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:43:52,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:43:52,032 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:43:52,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:43:52,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:43:52,032 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 -> 0d3b5dee297a010530e733718cca08900e46ab18a4a35ca825ad2e8828fb51c7 [2025-03-17 05:43:52,268 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:43:52,275 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:43:52,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:43:52,279 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:43:52,279 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:43:52,281 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2025-03-17 05:43:53,475 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4304092f/c1122c84a15b431c9096cdb283c8041e/FLAGdb8ee93ba [2025-03-17 05:43:53,637 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:43:53,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-2.i [2025-03-17 05:43:53,645 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4304092f/c1122c84a15b431c9096cdb283c8041e/FLAGdb8ee93ba [2025-03-17 05:43:53,657 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4304092f/c1122c84a15b431c9096cdb283c8041e [2025-03-17 05:43:53,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:43:53,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:43:53,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:43:53,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:43:53,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:43:53,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c00efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53, skipping insertion in model container [2025-03-17 05:43:53,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:43:53,771 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-p_file-2.i[915,928] [2025-03-17 05:43:53,807 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:43:53,820 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:43:53,828 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-p_file-2.i[915,928] [2025-03-17 05:43:53,850 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:43:53,865 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:43:53,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53 WrapperNode [2025-03-17 05:43:53,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:43:53,869 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:43:53,869 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:43:53,869 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:43:53,873 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,883 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,908 INFO L138 Inliner]: procedures = 33, calls = 164, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 521 [2025-03-17 05:43:53,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:43:53,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:43:53,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:43:53,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:43:53,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,921 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,937 INFO L175 MemorySlicer]: Split 131 memory accesses to 11 slices as follows [2, 12, 14, 22, 16, 14, 12, 8, 7, 14, 10]. 17 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 15 writes are split as follows [0, 1, 1, 1, 1, 1, 4, 1, 3, 1, 1]. [2025-03-17 05:43:53,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,950 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,951 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,954 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,959 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:43:53,960 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:43:53,960 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:43:53,960 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:43:53,961 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (1/1) ... [2025-03-17 05:43:53,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:43:53,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:43:53,988 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 05:43:53,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:43:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:43:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:43:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:43:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:43:54,015 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-17 05:43:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-17 05:43:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-17 05:43:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-17 05:43:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-17 05:43:54,016 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-17 05:43:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-17 05:43:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-17 05:43:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-17 05:43:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-17 05:43:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-17 05:43:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-17 05:43:54,017 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#6 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#7 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#8 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#9 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#10 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-17 05:43:54,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:43:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:43:54,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#6 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#7 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#8 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#9 [2025-03-17 05:43:54,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#10 [2025-03-17 05:43:54,191 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:43:54,192 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:43:54,672 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L99: havoc property_#t~ite100#1;havoc property_#t~mem99#1;havoc property_#t~mem89#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~mem84#1;havoc property_#t~ite88#1;havoc property_#t~mem85#1;havoc property_#t~mem86#1;havoc property_#t~mem87#1;havoc property_#t~ite98#1;havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~ite97#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~mem103#1;havoc property_#t~mem101#1;havoc property_#t~mem102#1;havoc property_#t~short104#1;havoc property_#t~ite124#1;havoc property_#t~mem109#1;havoc property_#t~mem105#1;havoc property_#t~ite107#1;havoc property_#t~mem106#1;havoc property_#t~mem108#1;havoc property_#t~ite121#1;havoc property_#t~mem113#1;havoc property_#t~mem112#1;havoc property_#t~mem110#1;havoc property_#t~mem111#1;havoc property_#t~short114#1;havoc property_#t~ite119#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem118#1;havoc property_#t~mem117#1;havoc property_#t~mem120#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short125#1;havoc property_#t~mem126#1;havoc property_#t~mem127#1;havoc property_#t~ite141#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite138#1;havoc property_#t~mem135#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~mem137#1;havoc property_#t~mem136#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short142#1; [2025-03-17 05:43:54,707 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2025-03-17 05:43:54,708 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:43:54,717 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:43:54,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:43:54,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:54 BoogieIcfgContainer [2025-03-17 05:43:54,719 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:43:54,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:43:54,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:43:54,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:43:54,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:43:53" (1/3) ... [2025-03-17 05:43:54,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a5f98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:54, skipping insertion in model container [2025-03-17 05:43:54,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:43:53" (2/3) ... [2025-03-17 05:43:54,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45a5f98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:43:54, skipping insertion in model container [2025-03-17 05:43:54,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:43:54" (3/3) ... [2025-03-17 05:43:54,726 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-2.i [2025-03-17 05:43:54,736 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:43:54,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-2.i that has 2 procedures, 94 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:43:54,774 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:43:54,783 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;@776adf7a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:43:54,783 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:43:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:43:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:43:54,794 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:54,795 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:54,795 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:54,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:54,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1217131305, now seen corresponding path program 1 times [2025-03-17 05:43:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:43:54,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1261283090] [2025-03-17 05:43:54,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:54,810 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-17 05:43:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:43:54,815 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-17 05:43:54,817 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-17 05:43:54,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:43:55,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:43:55,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:55,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:55,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:43:55,081 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-17 05:43:55,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:43:55,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:43:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1261283090] [2025-03-17 05:43:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1261283090] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:55,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:43:55,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324510298] [2025-03-17 05:43:55,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:55,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:43:55,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:43:55,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:43:55,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:43:55,132 INFO L87 Difference]: Start difference. First operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:43:55,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:55,147 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2025-03-17 05:43:55,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:43:55,149 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 96 [2025-03-17 05:43:55,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:55,153 INFO L225 Difference]: With dead ends: 185 [2025-03-17 05:43:55,153 INFO L226 Difference]: Without dead ends: 92 [2025-03-17 05:43:55,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:43:55,157 INFO L435 NwaCegarLoop]: 137 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, 137 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-17 05:43:55,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:43:55,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-03-17 05:43:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-03-17 05:43:55,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 78 states have internal predecessors, (113), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-17 05:43:55,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 137 transitions. [2025-03-17 05:43:55,195 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 137 transitions. Word has length 96 [2025-03-17 05:43:55,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:55,195 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 137 transitions. [2025-03-17 05:43:55,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:43:55,195 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 137 transitions. [2025-03-17 05:43:55,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:43:55,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:55,199 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:55,208 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-17 05:43:55,404 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-17 05:43:55,405 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:55,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:55,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1297965997, now seen corresponding path program 1 times [2025-03-17 05:43:55,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:43:55,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [644072366] [2025-03-17 05:43:55,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:55,406 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-17 05:43:55,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:43:55,408 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-17 05:43:55,410 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-17 05:43:55,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:43:55,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:43:55,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:55,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:55,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:43:55,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:55,708 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 17 treesize of output 9 [2025-03-17 05:43:55,714 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 17 treesize of output 9 [2025-03-17 05:43:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:56,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:43:56,066 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:43:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [644072366] [2025-03-17 05:43:56,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [644072366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:56,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:56,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:43:56,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33853893] [2025-03-17 05:43:56,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:56,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:43:56,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:43:56,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:43:56,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:43:56,070 INFO L87 Difference]: Start difference. First operand 92 states and 137 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:56,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:56,283 INFO L93 Difference]: Finished difference Result 275 states and 410 transitions. [2025-03-17 05:43:56,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:43:56,284 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 96 [2025-03-17 05:43:56,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:56,286 INFO L225 Difference]: With dead ends: 275 [2025-03-17 05:43:56,287 INFO L226 Difference]: Without dead ends: 184 [2025-03-17 05:43:56,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:43:56,288 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 122 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:56,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 379 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-03-17 05:43:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 152. [2025-03-17 05:43:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 125 states have (on average 1.424) internal successors, (178), 125 states have internal predecessors, (178), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-03-17 05:43:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 226 transitions. [2025-03-17 05:43:56,310 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 226 transitions. Word has length 96 [2025-03-17 05:43:56,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:56,310 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 226 transitions. [2025-03-17 05:43:56,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 226 transitions. [2025-03-17 05:43:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:43:56,311 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:56,311 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:56,317 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 (3)] Ended with exit code 0 [2025-03-17 05:43:56,511 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-17 05:43:56,512 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:56,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash -666624128, now seen corresponding path program 1 times [2025-03-17 05:43:56,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:43:56,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1415571876] [2025-03-17 05:43:56,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:56,513 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-17 05:43:56,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:43:56,514 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-17 05:43:56,516 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-17 05:43:56,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:43:56,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:43:56,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:56,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:56,742 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:43:56,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:57,485 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 37 treesize of output 25 [2025-03-17 05:43:57,491 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 33 treesize of output 21 [2025-03-17 05:43:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:43:57,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:43:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:57,732 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:43:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1415571876] [2025-03-17 05:43:57,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1415571876] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:57,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:43:57,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-17 05:43:57,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575556655] [2025-03-17 05:43:57,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:57,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:43:57,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:43:57,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:43:57,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:43:57,734 INFO L87 Difference]: Start difference. First operand 152 states and 226 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:57,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:57,910 INFO L93 Difference]: Finished difference Result 327 states and 483 transitions. [2025-03-17 05:43:57,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:43:57,912 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2025-03-17 05:43:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:57,913 INFO L225 Difference]: With dead ends: 327 [2025-03-17 05:43:57,913 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 05:43:57,914 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:43:57,914 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 154 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:57,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 432 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:43:57,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 05:43:57,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2025-03-17 05:43:57,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 200 states have (on average 1.445) internal successors, (289), 201 states have internal predecessors, (289), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:43:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 341 transitions. [2025-03-17 05:43:57,927 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 341 transitions. Word has length 102 [2025-03-17 05:43:57,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:57,927 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 341 transitions. [2025-03-17 05:43:57,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:57,928 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 341 transitions. [2025-03-17 05:43:57,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:43:57,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:57,929 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:57,936 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-17 05:43:58,133 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-17 05:43:58,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:58,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:58,134 INFO L85 PathProgramCache]: Analyzing trace with hash -455273215, now seen corresponding path program 1 times [2025-03-17 05:43:58,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:43:58,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1213362240] [2025-03-17 05:43:58,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:58,135 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-17 05:43:58,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:43:58,136 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-17 05:43:58,137 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-17 05:43:58,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:43:58,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:43:58,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:58,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:58,362 INFO L256 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:43:58,366 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:59,007 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 33 treesize of output 21 [2025-03-17 05:43:59,011 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 29 treesize of output 17 [2025-03-17 05:43:59,054 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:43:59,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:43:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:59,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:43:59,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1213362240] [2025-03-17 05:43:59,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1213362240] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:43:59,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:43:59,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-17 05:43:59,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681191430] [2025-03-17 05:43:59,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:59,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:43:59,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:43:59,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:43:59,212 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:43:59,212 INFO L87 Difference]: Start difference. First operand 231 states and 341 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:59,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:43:59,421 INFO L93 Difference]: Finished difference Result 422 states and 620 transitions. [2025-03-17 05:43:59,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:43:59,422 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2025-03-17 05:43:59,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:43:59,424 INFO L225 Difference]: With dead ends: 422 [2025-03-17 05:43:59,424 INFO L226 Difference]: Without dead ends: 275 [2025-03-17 05:43:59,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:43:59,425 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 106 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:43:59,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 373 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:43:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-17 05:43:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 236. [2025-03-17 05:43:59,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 205 states have (on average 1.4390243902439024) internal successors, (295), 206 states have internal predecessors, (295), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:43:59,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 347 transitions. [2025-03-17 05:43:59,447 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 347 transitions. Word has length 102 [2025-03-17 05:43:59,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:43:59,447 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 347 transitions. [2025-03-17 05:43:59,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:43:59,447 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 347 transitions. [2025-03-17 05:43:59,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:43:59,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:43:59,448 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:43:59,455 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 (5)] Forceful destruction successful, exit code 0 [2025-03-17 05:43:59,649 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-17 05:43:59,649 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:43:59,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:43:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 2042742722, now seen corresponding path program 1 times [2025-03-17 05:43:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:43:59,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000028299] [2025-03-17 05:43:59,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:43:59,650 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-17 05:43:59,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:43:59,652 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-17 05:43:59,653 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-17 05:43:59,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:43:59,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:43:59,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:43:59,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:43:59,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:43:59,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:43:59,879 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 15 [2025-03-17 05:43:59,902 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 24 treesize of output 16 [2025-03-17 05:43:59,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-03-17 05:43:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:43:59,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:43:59,954 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:43:59,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1000028299] [2025-03-17 05:43:59,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1000028299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:43:59,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:43:59,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 05:43:59,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529704476] [2025-03-17 05:43:59,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:43:59,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 05:43:59,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:43:59,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 05:43:59,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:43:59,955 INFO L87 Difference]: Start difference. First operand 236 states and 347 transitions. Second operand has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:00,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:00,424 INFO L93 Difference]: Finished difference Result 527 states and 781 transitions. [2025-03-17 05:44:00,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-17 05:44:00,428 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 102 [2025-03-17 05:44:00,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:00,430 INFO L225 Difference]: With dead ends: 527 [2025-03-17 05:44:00,430 INFO L226 Difference]: Without dead ends: 377 [2025-03-17 05:44:00,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:44:00,431 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 260 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:00,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 822 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:44:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-03-17 05:44:00,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 315. [2025-03-17 05:44:00,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 284 states have (on average 1.4612676056338028) internal successors, (415), 285 states have internal predecessors, (415), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2025-03-17 05:44:00,470 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 102 [2025-03-17 05:44:00,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:00,471 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2025-03-17 05:44:00,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.0) internal successors, (45), 9 states have internal predecessors, (45), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:00,471 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2025-03-17 05:44:00,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:44:00,472 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:00,472 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:00,480 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-17 05:44:00,673 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-17 05:44:00,673 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:00,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1255216705, now seen corresponding path program 1 times [2025-03-17 05:44:00,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:00,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586883343] [2025-03-17 05:44:00,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:00,674 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-17 05:44:00,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:00,676 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-17 05:44:00,681 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-17 05:44:00,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:44:00,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:44:00,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:00,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:00,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:44:00,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:01,577 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 37 treesize of output 25 [2025-03-17 05:44:01,582 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 33 treesize of output 21 [2025-03-17 05:44:01,638 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:44:01,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:01,781 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:01,781 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:01,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586883343] [2025-03-17 05:44:01,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586883343] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:01,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:01,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-17 05:44:01,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070112593] [2025-03-17 05:44:01,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:01,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:01,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:01,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:01,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:44:01,782 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:01,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:01,955 INFO L93 Difference]: Finished difference Result 661 states and 977 transitions. [2025-03-17 05:44:01,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:44:01,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:44:01,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:01,959 INFO L225 Difference]: With dead ends: 661 [2025-03-17 05:44:01,959 INFO L226 Difference]: Without dead ends: 464 [2025-03-17 05:44:01,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:44:01,960 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 75 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:01,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 589 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:01,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2025-03-17 05:44:01,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 315. [2025-03-17 05:44:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 315 states, 284 states have (on average 1.4612676056338028) internal successors, (415), 285 states have internal predecessors, (415), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2025-03-17 05:44:01,979 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 104 [2025-03-17 05:44:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:01,980 INFO L471 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2025-03-17 05:44:01,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2025-03-17 05:44:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:44:01,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:01,981 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:01,988 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-17 05:44:02,181 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-17 05:44:02,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:02,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:02,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1043865792, now seen corresponding path program 1 times [2025-03-17 05:44:02,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:02,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [596382178] [2025-03-17 05:44:02,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:02,183 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-17 05:44:02,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:02,184 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-17 05:44:02,185 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-17 05:44:02,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:44:02,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:44:02,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:02,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:02,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:44:02,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:02,435 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 25 treesize of output 17 [2025-03-17 05:44:02,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-03-17 05:44:02,475 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:02,475 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:44:02,475 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:02,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [596382178] [2025-03-17 05:44:02,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [596382178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:02,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:02,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:44:02,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021304490] [2025-03-17 05:44:02,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:02,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:44:02,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:02,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:44:02,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:44:02,477 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:02,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:02,930 INFO L93 Difference]: Finished difference Result 630 states and 938 transitions. [2025-03-17 05:44:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:44:02,931 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:44:02,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:02,932 INFO L225 Difference]: With dead ends: 630 [2025-03-17 05:44:02,933 INFO L226 Difference]: Without dead ends: 435 [2025-03-17 05:44:02,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:44:02,933 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 69 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 1011 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:02,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 1011 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 05:44:02,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-03-17 05:44:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 371. [2025-03-17 05:44:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 340 states have (on average 1.473529411764706) internal successors, (501), 341 states have internal predecessors, (501), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 553 transitions. [2025-03-17 05:44:02,950 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 553 transitions. Word has length 104 [2025-03-17 05:44:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:02,950 INFO L471 AbstractCegarLoop]: Abstraction has 371 states and 553 transitions. [2025-03-17 05:44:02,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:02,950 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 553 transitions. [2025-03-17 05:44:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:44:02,952 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:02,953 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:02,961 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-17 05:44:03,153 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-17 05:44:03,153 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:03,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:03,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1420346529, now seen corresponding path program 1 times [2025-03-17 05:44:03,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:03,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600156692] [2025-03-17 05:44:03,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:03,154 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-17 05:44:03,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:03,157 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-17 05:44:03,158 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-17 05:44:03,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:44:03,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:44:03,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:03,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:03,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 05:44:03,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:03,918 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 33 treesize of output 21 [2025-03-17 05:44:03,921 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 29 treesize of output 17 [2025-03-17 05:44:03,953 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:44:03,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:04,104 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:04,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600156692] [2025-03-17 05:44:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600156692] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-03-17 05:44:04,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032592766] [2025-03-17 05:44:04,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:04,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:04,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:04,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2025-03-17 05:44:04,105 INFO L87 Difference]: Start difference. First operand 371 states and 553 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:04,312 INFO L93 Difference]: Finished difference Result 649 states and 965 transitions. [2025-03-17 05:44:04,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:44:04,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:44:04,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:04,316 INFO L225 Difference]: With dead ends: 649 [2025-03-17 05:44:04,316 INFO L226 Difference]: Without dead ends: 415 [2025-03-17 05:44:04,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:44:04,317 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 52 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:04,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 486 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:44:04,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-17 05:44:04,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 375. [2025-03-17 05:44:04,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 344 states have (on average 1.4738372093023255) internal successors, (507), 345 states have internal predecessors, (507), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:04,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 559 transitions. [2025-03-17 05:44:04,332 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 559 transitions. Word has length 104 [2025-03-17 05:44:04,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:04,333 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 559 transitions. [2025-03-17 05:44:04,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 559 transitions. [2025-03-17 05:44:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-17 05:44:04,334 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:04,334 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:04,341 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-17 05:44:04,538 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-17 05:44:04,538 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:04,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1077669408, now seen corresponding path program 1 times [2025-03-17 05:44:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101714592] [2025-03-17 05:44:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:04,539 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-17 05:44:04,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:04,540 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-17 05:44:04,541 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-17 05:44:04,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-17 05:44:04,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-17 05:44:04,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:04,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:04,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-17 05:44:04,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:04,767 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 24 treesize of output 16 [2025-03-17 05:44:04,784 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 21 treesize of output 13 [2025-03-17 05:44:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:04,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:44:04,804 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:04,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101714592] [2025-03-17 05:44:04,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101714592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:04,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:04,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:44:04,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762991758] [2025-03-17 05:44:04,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:04,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:44:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:04,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:44:04,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:44:04,805 INFO L87 Difference]: Start difference. First operand 375 states and 559 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:05,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:05,153 INFO L93 Difference]: Finished difference Result 672 states and 1001 transitions. [2025-03-17 05:44:05,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:44:05,154 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 104 [2025-03-17 05:44:05,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:05,155 INFO L225 Difference]: With dead ends: 672 [2025-03-17 05:44:05,155 INFO L226 Difference]: Without dead ends: 434 [2025-03-17 05:44:05,156 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:44:05,156 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 68 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:05,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 901 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:44:05,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2025-03-17 05:44:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 376. [2025-03-17 05:44:05,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 345 states have (on average 1.4695652173913043) internal successors, (507), 346 states have internal predecessors, (507), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:05,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 559 transitions. [2025-03-17 05:44:05,168 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 559 transitions. Word has length 104 [2025-03-17 05:44:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:05,168 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 559 transitions. [2025-03-17 05:44:05,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:05,168 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 559 transitions. [2025-03-17 05:44:05,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:44:05,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:05,169 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:05,178 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-17 05:44:05,370 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-17 05:44:05,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:05,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2084957378, now seen corresponding path program 1 times [2025-03-17 05:44:05,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:05,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [277872583] [2025-03-17 05:44:05,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:05,371 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-17 05:44:05,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:05,373 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-17 05:44:05,375 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-17 05:44:05,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:44:05,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:44:05,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:05,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:05,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-17 05:44:05,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:06,045 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 27 treesize of output 19 [2025-03-17 05:44:06,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 05:44:06,087 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 18 treesize of output 10 [2025-03-17 05:44:06,095 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 18 treesize of output 10 [2025-03-17 05:44:06,131 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:44:06,131 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:06,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:44:06,347 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 28 treesize of output 31 [2025-03-17 05:44:06,524 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:06,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [277872583] [2025-03-17 05:44:06,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [277872583] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:06,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [946682367] [2025-03-17 05:44:06,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:06,525 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:44:06,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:44:06,538 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:44:06,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2025-03-17 05:44:06,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:44:06,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:44:06,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:06,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:07,018 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:44:07,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:07,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 15 treesize of output 1 [2025-03-17 05:44:07,647 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 12 treesize of output 8 [2025-03-17 05:44:08,757 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 17 treesize of output 13 [2025-03-17 05:44:08,760 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 23 treesize of output 15 [2025-03-17 05:44:08,834 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 26 treesize of output 14 [2025-03-17 05:44:08,837 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 18 treesize of output 10 [2025-03-17 05:44:08,858 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 12 proven. 188 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-17 05:44:08,858 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:09,002 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 49 treesize of output 45 [2025-03-17 05:44:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [946682367] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:09,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:44:09,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2025-03-17 05:44:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199991691] [2025-03-17 05:44:09,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:44:09,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 05:44:09,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:09,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 05:44:09,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 05:44:09,173 INFO L87 Difference]: Start difference. First operand 376 states and 559 transitions. Second operand has 28 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 11 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (24), 7 states have call predecessors, (24), 11 states have call successors, (24) [2025-03-17 05:44:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:11,211 INFO L93 Difference]: Finished difference Result 859 states and 1231 transitions. [2025-03-17 05:44:11,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-17 05:44:11,215 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 11 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (24), 7 states have call predecessors, (24), 11 states have call successors, (24) Word has length 105 [2025-03-17 05:44:11,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:11,217 INFO L225 Difference]: With dead ends: 859 [2025-03-17 05:44:11,217 INFO L226 Difference]: Without dead ends: 610 [2025-03-17 05:44:11,220 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 328 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=754, Invalid=3152, Unknown=0, NotChecked=0, Total=3906 [2025-03-17 05:44:11,220 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 1000 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:11,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 957 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:44:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2025-03-17 05:44:11,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 591. [2025-03-17 05:44:11,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 545 states have (on average 1.4110091743119266) internal successors, (769), 548 states have internal predecessors, (769), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-17 05:44:11,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 833 transitions. [2025-03-17 05:44:11,245 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 833 transitions. Word has length 105 [2025-03-17 05:44:11,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:11,245 INFO L471 AbstractCegarLoop]: Abstraction has 591 states and 833 transitions. [2025-03-17 05:44:11,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 4.541666666666667) internal successors, (109), 23 states have internal predecessors, (109), 11 states have call successors, (24), 11 states have call predecessors, (24), 11 states have return successors, (24), 7 states have call predecessors, (24), 11 states have call successors, (24) [2025-03-17 05:44:11,246 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 833 transitions. [2025-03-17 05:44:11,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-17 05:44:11,247 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:11,247 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:11,254 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-17 05:44:11,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Ended with exit code 0 [2025-03-17 05:44:11,647 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,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:44:11,647 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:11,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:11,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1719286160, now seen corresponding path program 1 times [2025-03-17 05:44:11,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:11,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922668465] [2025-03-17 05:44:11,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:11,648 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-17 05:44:11,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:11,650 INFO L229 MonitoredProcess]: Starting monitored process 13 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-17 05:44:11,651 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 (13)] Waiting until timeout for monitored process [2025-03-17 05:44:11,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-17 05:44:11,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-17 05:44:11,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:11,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:11,856 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:44:11,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:12,310 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 17 treesize of output 13 [2025-03-17 05:44:12,338 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 18 treesize of output 10 [2025-03-17 05:44:12,475 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 54 treesize of output 42 [2025-03-17 05:44:12,478 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 65 treesize of output 41 [2025-03-17 05:44:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:44:12,528 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:12,680 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:12,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922668465] [2025-03-17 05:44:12,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922668465] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:12,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:12,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [18] total 23 [2025-03-17 05:44:12,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874236236] [2025-03-17 05:44:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:12,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:44:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:12,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:44:12,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:44:12,681 INFO L87 Difference]: Start difference. First operand 591 states and 833 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:12,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:12,983 INFO L93 Difference]: Finished difference Result 1006 states and 1423 transitions. [2025-03-17 05:44:12,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:44:12,984 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 105 [2025-03-17 05:44:12,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:12,986 INFO L225 Difference]: With dead ends: 1006 [2025-03-17 05:44:12,986 INFO L226 Difference]: Without dead ends: 603 [2025-03-17 05:44:12,987 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:44:12,987 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 67 mSDsluCounter, 671 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 797 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:12,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 797 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:44:12,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-03-17 05:44:13,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 499. [2025-03-17 05:44:13,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 462 states have (on average 1.4177489177489178) internal successors, (655), 463 states have internal predecessors, (655), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 707 transitions. [2025-03-17 05:44:13,008 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 707 transitions. Word has length 105 [2025-03-17 05:44:13,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:13,009 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 707 transitions. [2025-03-17 05:44:13,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:13,009 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 707 transitions. [2025-03-17 05:44:13,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-17 05:44:13,010 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:13,010 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:13,017 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 (13)] Ended with exit code 0 [2025-03-17 05:44:13,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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-17 05:44:13,214 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:13,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:13,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1625678306, now seen corresponding path program 1 times [2025-03-17 05:44:13,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:13,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175259087] [2025-03-17 05:44:13,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:13,215 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-17 05:44:13,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:13,216 INFO L229 MonitoredProcess]: Starting monitored process 14 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-17 05:44:13,217 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 (14)] Waiting until timeout for monitored process [2025-03-17 05:44:13,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-17 05:44:13,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-17 05:44:13,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:13,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:13,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:44:13,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:13,542 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 15 [2025-03-17 05:44:13,562 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 24 treesize of output 16 [2025-03-17 05:44:13,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2025-03-17 05:44:13,630 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:44:13,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:13,787 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:13,787 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:13,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175259087] [2025-03-17 05:44:13,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175259087] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:13,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:13,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 17 [2025-03-17 05:44:13,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057864587] [2025-03-17 05:44:13,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:13,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:44:13,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:13,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:44:13,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2025-03-17 05:44:13,788 INFO L87 Difference]: Start difference. First operand 499 states and 707 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:14,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:14,216 INFO L93 Difference]: Finished difference Result 1009 states and 1423 transitions. [2025-03-17 05:44:14,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:44:14,216 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 106 [2025-03-17 05:44:14,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:14,219 INFO L225 Difference]: With dead ends: 1009 [2025-03-17 05:44:14,219 INFO L226 Difference]: Without dead ends: 693 [2025-03-17 05:44:14,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:44:14,222 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 95 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:14,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1628 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:44:14,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-17 05:44:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 569. [2025-03-17 05:44:14,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 532 states have (on average 1.419172932330827) internal successors, (755), 533 states have internal predecessors, (755), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 807 transitions. [2025-03-17 05:44:14,249 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 807 transitions. Word has length 106 [2025-03-17 05:44:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:14,249 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 807 transitions. [2025-03-17 05:44:14,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 807 transitions. [2025-03-17 05:44:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:44:14,250 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:14,250 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:14,258 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 (14)] Ended with exit code 0 [2025-03-17 05:44:14,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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-17 05:44:14,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:14,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:14,451 INFO L85 PathProgramCache]: Analyzing trace with hash 816456996, now seen corresponding path program 1 times [2025-03-17 05:44:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208622357] [2025-03-17 05:44:14,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:14,452 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-17 05:44:14,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:14,454 INFO L229 MonitoredProcess]: Starting monitored process 15 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-17 05:44:14,455 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 (15)] Waiting until timeout for monitored process [2025-03-17 05:44:14,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:14,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:14,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:14,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:14,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:44:14,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:15,212 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 31 [2025-03-17 05:44:15,256 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 59 treesize of output 47 [2025-03-17 05:44:15,258 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 47 treesize of output 35 [2025-03-17 05:44:15,318 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:44:15,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:15,561 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:15,561 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:15,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208622357] [2025-03-17 05:44:15,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208622357] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:15,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:15,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2025-03-17 05:44:15,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504446361] [2025-03-17 05:44:15,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:15,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:44:15,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:15,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:44:15,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:44:15,564 INFO L87 Difference]: Start difference. First operand 569 states and 807 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:15,979 INFO L93 Difference]: Finished difference Result 990 states and 1419 transitions. [2025-03-17 05:44:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:44:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-17 05:44:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:15,983 INFO L225 Difference]: With dead ends: 990 [2025-03-17 05:44:15,983 INFO L226 Difference]: Without dead ends: 633 [2025-03-17 05:44:15,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:44:15,985 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 64 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:15,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 781 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:44:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-03-17 05:44:16,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 575. [2025-03-17 05:44:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 538 states have (on average 1.420074349442379) internal successors, (764), 539 states have internal predecessors, (764), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:16,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 816 transitions. [2025-03-17 05:44:16,024 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 816 transitions. Word has length 107 [2025-03-17 05:44:16,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:16,024 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 816 transitions. [2025-03-17 05:44:16,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:16,024 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 816 transitions. [2025-03-17 05:44:16,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:44:16,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:16,026 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:16,034 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 (15)] Ended with exit code 0 [2025-03-17 05:44:16,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-17 05:44:16,227 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:16,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:16,227 INFO L85 PathProgramCache]: Analyzing trace with hash -980494363, now seen corresponding path program 1 times [2025-03-17 05:44:16,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:16,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [797481211] [2025-03-17 05:44:16,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:16,227 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-17 05:44:16,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:16,229 INFO L229 MonitoredProcess]: Starting monitored process 16 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-17 05:44:16,230 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 (16)] Waiting until timeout for monitored process [2025-03-17 05:44:16,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:16,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:16,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:16,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:16,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:44:16,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:16,634 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 33 treesize of output 25 [2025-03-17 05:44:16,636 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 29 treesize of output 21 [2025-03-17 05:44:16,641 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 25 treesize of output 17 [2025-03-17 05:44:16,682 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:44:16,682 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:16,811 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:16,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [797481211] [2025-03-17 05:44:16,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [797481211] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:16,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:16,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:44:16,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287844510] [2025-03-17 05:44:16,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:16,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:16,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:16,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:16,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:44:16,812 INFO L87 Difference]: Start difference. First operand 575 states and 816 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:17,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:17,030 INFO L93 Difference]: Finished difference Result 991 states and 1415 transitions. [2025-03-17 05:44:17,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:44:17,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-17 05:44:17,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:17,034 INFO L225 Difference]: With dead ends: 991 [2025-03-17 05:44:17,034 INFO L226 Difference]: Without dead ends: 628 [2025-03-17 05:44:17,034 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:44:17,035 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 68 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:17,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 572 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:44:17,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-03-17 05:44:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 575. [2025-03-17 05:44:17,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 538 states have (on average 1.412639405204461) internal successors, (760), 539 states have internal predecessors, (760), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:17,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 812 transitions. [2025-03-17 05:44:17,056 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 812 transitions. Word has length 107 [2025-03-17 05:44:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:17,057 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 812 transitions. [2025-03-17 05:44:17,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 812 transitions. [2025-03-17 05:44:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:44:17,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:17,058 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:17,066 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 (16)] Forceful destruction successful, exit code 0 [2025-03-17 05:44:17,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-17 05:44:17,259 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:17,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1047501116, now seen corresponding path program 1 times [2025-03-17 05:44:17,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:17,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888917772] [2025-03-17 05:44:17,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:17,260 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-17 05:44:17,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:17,262 INFO L229 MonitoredProcess]: Starting monitored process 17 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-17 05:44:17,264 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 (17)] Waiting until timeout for monitored process [2025-03-17 05:44:17,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:17,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:17,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:17,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:17,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:44:17,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:18,027 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 34 treesize of output 26 [2025-03-17 05:44:18,031 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 30 treesize of output 22 [2025-03-17 05:44:18,035 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 35 treesize of output 23 [2025-03-17 05:44:18,088 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 27 treesize of output 19 [2025-03-17 05:44:18,147 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:44:18,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:18,241 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 41 treesize of output 33 [2025-03-17 05:44:18,537 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:18,538 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888917772] [2025-03-17 05:44:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888917772] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:18,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2025-03-17 05:44:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949938497] [2025-03-17 05:44:18,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:18,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:44:18,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:18,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:44:18,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:44:18,539 INFO L87 Difference]: Start difference. First operand 575 states and 812 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:19,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:19,193 INFO L93 Difference]: Finished difference Result 992 states and 1410 transitions. [2025-03-17 05:44:19,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:44:19,194 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-17 05:44:19,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:19,197 INFO L225 Difference]: With dead ends: 992 [2025-03-17 05:44:19,197 INFO L226 Difference]: Without dead ends: 629 [2025-03-17 05:44:19,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:44:19,198 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 182 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:19,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 708 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:44:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2025-03-17 05:44:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 575. [2025-03-17 05:44:19,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 538 states have (on average 1.412639405204461) internal successors, (760), 539 states have internal predecessors, (760), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:19,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 812 transitions. [2025-03-17 05:44:19,219 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 812 transitions. Word has length 107 [2025-03-17 05:44:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:19,219 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 812 transitions. [2025-03-17 05:44:19,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:19,219 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 812 transitions. [2025-03-17 05:44:19,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:44:19,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:19,220 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:19,228 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 (17)] Ended with exit code 0 [2025-03-17 05:44:19,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-17 05:44:19,421 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:19,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:19,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1480321118, now seen corresponding path program 1 times [2025-03-17 05:44:19,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:19,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1694216704] [2025-03-17 05:44:19,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:19,422 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-17 05:44:19,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:19,425 INFO L229 MonitoredProcess]: Starting monitored process 18 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-17 05:44:19,426 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 (18)] Waiting until timeout for monitored process [2025-03-17 05:44:19,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:19,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:19,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:19,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:19,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:44:19,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:20,207 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 42 treesize of output 30 [2025-03-17 05:44:20,254 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 58 treesize of output 46 [2025-03-17 05:44:20,256 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 46 treesize of output 34 [2025-03-17 05:44:20,302 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:44:20,302 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:20,521 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:20,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1694216704] [2025-03-17 05:44:20,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1694216704] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:20,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:20,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2025-03-17 05:44:20,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230610108] [2025-03-17 05:44:20,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:20,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:44:20,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:20,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:44:20,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:44:20,522 INFO L87 Difference]: Start difference. First operand 575 states and 812 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:20,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:20,887 INFO L93 Difference]: Finished difference Result 987 states and 1404 transitions. [2025-03-17 05:44:20,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:44:20,888 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-17 05:44:20,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:20,891 INFO L225 Difference]: With dead ends: 987 [2025-03-17 05:44:20,891 INFO L226 Difference]: Without dead ends: 624 [2025-03-17 05:44:20,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=425, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:44:20,892 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 124 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:20,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 620 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:44:20,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-03-17 05:44:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 575. [2025-03-17 05:44:20,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 538 states have (on average 1.412639405204461) internal successors, (760), 539 states have internal predecessors, (760), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:20,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 812 transitions. [2025-03-17 05:44:20,916 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 812 transitions. Word has length 107 [2025-03-17 05:44:20,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:20,917 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 812 transitions. [2025-03-17 05:44:20,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 812 transitions. [2025-03-17 05:44:20,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:44:20,918 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:20,918 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:20,926 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 (18)] Ended with exit code 0 [2025-03-17 05:44:21,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-17 05:44:21,118 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:21,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:21,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1186918111, now seen corresponding path program 1 times [2025-03-17 05:44:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080556601] [2025-03-17 05:44:21,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:21,119 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-17 05:44:21,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:21,121 INFO L229 MonitoredProcess]: Starting monitored process 19 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-17 05:44:21,122 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 (19)] Waiting until timeout for monitored process [2025-03-17 05:44:21,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:21,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:21,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:21,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:21,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-17 05:44:21,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:21,732 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 35 [2025-03-17 05:44:21,734 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 35 treesize of output 27 [2025-03-17 05:44:21,906 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 34 treesize of output 22 [2025-03-17 05:44:22,002 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 26 treesize of output 18 [2025-03-17 05:44:22,086 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:44:22,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:22,309 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 41 treesize of output 33 [2025-03-17 05:44:22,356 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:22,356 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:22,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080556601] [2025-03-17 05:44:22,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080556601] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:22,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:22,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2025-03-17 05:44:22,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686256541] [2025-03-17 05:44:22,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:22,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:44:22,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:22,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:44:22,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-17 05:44:22,358 INFO L87 Difference]: Start difference. First operand 575 states and 812 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:23,420 INFO L93 Difference]: Finished difference Result 977 states and 1388 transitions. [2025-03-17 05:44:23,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:44:23,421 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-17 05:44:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:23,423 INFO L225 Difference]: With dead ends: 977 [2025-03-17 05:44:23,423 INFO L226 Difference]: Without dead ends: 614 [2025-03-17 05:44:23,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:44:23,424 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 167 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:23,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 666 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:44:23,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2025-03-17 05:44:23,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 574. [2025-03-17 05:44:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 537 states have (on average 1.4115456238361266) internal successors, (758), 538 states have internal predecessors, (758), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 810 transitions. [2025-03-17 05:44:23,445 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 810 transitions. Word has length 107 [2025-03-17 05:44:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:23,445 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 810 transitions. [2025-03-17 05:44:23,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 810 transitions. [2025-03-17 05:44:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:44:23,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:23,446 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:23,453 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 (19)] Ended with exit code 0 [2025-03-17 05:44:23,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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-17 05:44:23,647 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:23,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:23,647 INFO L85 PathProgramCache]: Analyzing trace with hash 847476803, now seen corresponding path program 1 times [2025-03-17 05:44:23,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:23,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1918897257] [2025-03-17 05:44:23,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:23,648 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-17 05:44:23,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:23,650 INFO L229 MonitoredProcess]: Starting monitored process 20 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-17 05:44:23,655 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 (20)] Waiting until timeout for monitored process [2025-03-17 05:44:23,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:23,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:23,864 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:23,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:23,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 05:44:23,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:24,448 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 25 treesize of output 17 [2025-03-17 05:44:24,644 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 21 treesize of output 13 [2025-03-17 05:44:24,709 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 39 treesize of output 31 [2025-03-17 05:44:24,714 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 31 treesize of output 23 [2025-03-17 05:44:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:44:24,809 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:25,117 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 36 treesize of output 28 [2025-03-17 05:44:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:25,264 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:25,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1918897257] [2025-03-17 05:44:25,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1918897257] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:25,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:25,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 22 [2025-03-17 05:44:25,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520658135] [2025-03-17 05:44:25,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:25,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-17 05:44:25,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:25,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-17 05:44:25,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:44:25,265 INFO L87 Difference]: Start difference. First operand 574 states and 810 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:26,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:26,084 INFO L93 Difference]: Finished difference Result 981 states and 1394 transitions. [2025-03-17 05:44:26,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:44:26,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-17 05:44:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:26,087 INFO L225 Difference]: With dead ends: 981 [2025-03-17 05:44:26,087 INFO L226 Difference]: Without dead ends: 619 [2025-03-17 05:44:26,088 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2025-03-17 05:44:26,088 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 121 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:26,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 803 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 05:44:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2025-03-17 05:44:26,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 523. [2025-03-17 05:44:26,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 486 states have (on average 1.4115226337448559) internal successors, (686), 487 states have internal predecessors, (686), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 738 transitions. [2025-03-17 05:44:26,109 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 738 transitions. Word has length 107 [2025-03-17 05:44:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:26,109 INFO L471 AbstractCegarLoop]: Abstraction has 523 states and 738 transitions. [2025-03-17 05:44:26,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 738 transitions. [2025-03-17 05:44:26,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:44:26,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:26,110 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:26,118 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 (20)] Ended with exit code 0 [2025-03-17 05:44:26,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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-17 05:44:26,310 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:26,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:26,311 INFO L85 PathProgramCache]: Analyzing trace with hash 780470050, now seen corresponding path program 1 times [2025-03-17 05:44:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:26,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51421513] [2025-03-17 05:44:26,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:26,311 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-17 05:44:26,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:26,313 INFO L229 MonitoredProcess]: Starting monitored process 21 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-17 05:44:26,314 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 (21)] Waiting until timeout for monitored process [2025-03-17 05:44:26,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:26,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:26,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:26,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:26,570 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:44:26,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:27,591 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 59 treesize of output 43 [2025-03-17 05:44:27,595 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 39 treesize of output 27 [2025-03-17 05:44:27,598 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 38 treesize of output 26 [2025-03-17 05:44:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:44:27,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:28,043 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:28,043 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:28,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51421513] [2025-03-17 05:44:28,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51421513] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:28,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:28,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [17] total 22 [2025-03-17 05:44:28,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206860459] [2025-03-17 05:44:28,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:28,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:44:28,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:28,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:44:28,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:44:28,044 INFO L87 Difference]: Start difference. First operand 523 states and 738 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:28,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:28,436 INFO L93 Difference]: Finished difference Result 1048 states and 1479 transitions. [2025-03-17 05:44:28,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:44:28,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 107 [2025-03-17 05:44:28,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:28,439 INFO L225 Difference]: With dead ends: 1048 [2025-03-17 05:44:28,439 INFO L226 Difference]: Without dead ends: 687 [2025-03-17 05:44:28,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:44:28,440 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 72 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:28,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 615 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:44:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2025-03-17 05:44:28,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 554. [2025-03-17 05:44:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 517 states have (on average 1.4003868471953578) internal successors, (724), 518 states have internal predecessors, (724), 26 states have call successors, (26), 10 states have call predecessors, (26), 10 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-17 05:44:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 776 transitions. [2025-03-17 05:44:28,462 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 776 transitions. Word has length 107 [2025-03-17 05:44:28,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:28,462 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 776 transitions. [2025-03-17 05:44:28,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 776 transitions. [2025-03-17 05:44:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:44:28,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:28,463 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:28,472 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 (21)] Ended with exit code 0 [2025-03-17 05:44:28,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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-17 05:44:28,664 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:28,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash 702414055, now seen corresponding path program 1 times [2025-03-17 05:44:28,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:28,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630473837] [2025-03-17 05:44:28,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:28,665 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-17 05:44:28,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:28,667 INFO L229 MonitoredProcess]: Starting monitored process 22 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-17 05:44:28,668 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 (22)] Waiting until timeout for monitored process [2025-03-17 05:44:28,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:28,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:28,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:28,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:28,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:44:28,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:29,533 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 15 treesize of output 1 [2025-03-17 05:44:29,675 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 128 treesize of output 92 [2025-03-17 05:44:29,677 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 140 treesize of output 80 [2025-03-17 05:44:29,761 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-17 05:44:29,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:30,018 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630473837] [2025-03-17 05:44:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630473837] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1951040709] [2025-03-17 05:44:30,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:30,019 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:44:30,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:44:30,021 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:44:30,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2025-03-17 05:44:30,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:30,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:30,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:30,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:30,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:44:30,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:31,466 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 15 treesize of output 1 [2025-03-17 05:44:32,034 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 15 treesize of output 1 [2025-03-17 05:44:32,285 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 128 treesize of output 92 [2025-03-17 05:44:32,287 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 140 treesize of output 80 [2025-03-17 05:44:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-17 05:44:32,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:32,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1951040709] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:32,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:44:32,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2025-03-17 05:44:32,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711541372] [2025-03-17 05:44:32,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:44:32,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:44:32,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:32,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:44:32,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:44:32,446 INFO L87 Difference]: Start difference. First operand 554 states and 776 transitions. Second operand has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 17 states have internal predecessors, (101), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 05:44:33,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:33,867 INFO L93 Difference]: Finished difference Result 1235 states and 1717 transitions. [2025-03-17 05:44:33,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:44:33,868 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 17 states have internal predecessors, (101), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) Word has length 107 [2025-03-17 05:44:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:33,871 INFO L225 Difference]: With dead ends: 1235 [2025-03-17 05:44:33,871 INFO L226 Difference]: Without dead ends: 1233 [2025-03-17 05:44:33,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:44:33,871 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 718 mSDsluCounter, 1418 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:33,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1572 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:44:33,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-03-17 05:44:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1227. [2025-03-17 05:44:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1151 states have (on average 1.3918331885317115) internal successors, (1602), 1156 states have internal predecessors, (1602), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:44:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1710 transitions. [2025-03-17 05:44:33,920 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1710 transitions. Word has length 107 [2025-03-17 05:44:33,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:33,920 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1710 transitions. [2025-03-17 05:44:33,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.611111111111111) internal successors, (101), 17 states have internal predecessors, (101), 4 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 4 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-17 05:44:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1710 transitions. [2025-03-17 05:44:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-17 05:44:33,921 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:33,921 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:33,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Ended with exit code 0 [2025-03-17 05:44:34,129 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 (22)] Ended with exit code 0 [2025-03-17 05:44:34,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,22 /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-17 05:44:34,322 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:34,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:34,323 INFO L85 PathProgramCache]: Analyzing trace with hash -998326424, now seen corresponding path program 1 times [2025-03-17 05:44:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:34,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [515990034] [2025-03-17 05:44:34,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:34,323 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-17 05:44:34,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:34,325 INFO L229 MonitoredProcess]: Starting monitored process 24 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-17 05:44:34,331 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 (24)] Waiting until timeout for monitored process [2025-03-17 05:44:34,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-17 05:44:34,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-17 05:44:34,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:34,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:34,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:44:34,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-17 05:44:34,537 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:44:34,537 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:34,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [515990034] [2025-03-17 05:44:34,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [515990034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:34,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:34,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:44:34,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655174760] [2025-03-17 05:44:34,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:34,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:44:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:34,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:44:34,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:44:34,538 INFO L87 Difference]: Start difference. First operand 1227 states and 1710 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:44:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:34,605 INFO L93 Difference]: Finished difference Result 2249 states and 3146 transitions. [2025-03-17 05:44:34,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:44:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-03-17 05:44:34,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:34,609 INFO L225 Difference]: With dead ends: 2249 [2025-03-17 05:44:34,609 INFO L226 Difference]: Without dead ends: 1227 [2025-03-17 05:44:34,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 104 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-17 05:44:34,611 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:34,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:44:34,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2025-03-17 05:44:34,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1227. [2025-03-17 05:44:34,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 1151 states have (on average 1.3900955690703736) internal successors, (1600), 1156 states have internal predecessors, (1600), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:44:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1708 transitions. [2025-03-17 05:44:34,670 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1708 transitions. Word has length 107 [2025-03-17 05:44:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:34,670 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1708 transitions. [2025-03-17 05:44:34,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-17 05:44:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1708 transitions. [2025-03-17 05:44:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:44:34,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:34,672 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:34,683 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 (24)] Ended with exit code 0 [2025-03-17 05:44:34,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-17 05:44:34,873 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:34,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash 795238587, now seen corresponding path program 1 times [2025-03-17 05:44:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:34,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681858452] [2025-03-17 05:44:34,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:34,874 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-17 05:44:34,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:34,875 INFO L229 MonitoredProcess]: Starting monitored process 25 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-17 05:44:34,876 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 (25)] Waiting until timeout for monitored process [2025-03-17 05:44:34,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:44:35,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:44:35,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:35,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:35,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-17 05:44:35,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:35,827 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 18 treesize of output 10 [2025-03-17 05:44:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:44:36,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:36,228 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:36,228 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:36,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681858452] [2025-03-17 05:44:36,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681858452] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:36,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:36,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [17] total 22 [2025-03-17 05:44:36,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712540673] [2025-03-17 05:44:36,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:36,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:44:36,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:36,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:44:36,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2025-03-17 05:44:36,230 INFO L87 Difference]: Start difference. First operand 1227 states and 1708 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:36,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:36,649 INFO L93 Difference]: Finished difference Result 2832 states and 3995 transitions. [2025-03-17 05:44:36,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:44:36,652 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-17 05:44:36,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:36,657 INFO L225 Difference]: With dead ends: 2832 [2025-03-17 05:44:36,657 INFO L226 Difference]: Without dead ends: 1958 [2025-03-17 05:44:36,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:44:36,659 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 262 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:36,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 630 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:44:36,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2025-03-17 05:44:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1383. [2025-03-17 05:44:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1383 states, 1307 states have (on average 1.4070390206579955) internal successors, (1839), 1312 states have internal predecessors, (1839), 54 states have call successors, (54), 21 states have call predecessors, (54), 21 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-17 05:44:36,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1383 states to 1383 states and 1947 transitions. [2025-03-17 05:44:36,719 INFO L78 Accepts]: Start accepts. Automaton has 1383 states and 1947 transitions. Word has length 108 [2025-03-17 05:44:36,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:36,720 INFO L471 AbstractCegarLoop]: Abstraction has 1383 states and 1947 transitions. [2025-03-17 05:44:36,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:36,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1383 states and 1947 transitions. [2025-03-17 05:44:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-17 05:44:36,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:36,721 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:36,728 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 (25)] Ended with exit code 0 [2025-03-17 05:44:36,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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-17 05:44:36,922 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:36,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:36,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2040003068, now seen corresponding path program 1 times [2025-03-17 05:44:36,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:36,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950015858] [2025-03-17 05:44:36,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:36,923 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-17 05:44:36,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:36,925 INFO L229 MonitoredProcess]: Starting monitored process 26 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-17 05:44:36,926 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 (26)] Waiting until timeout for monitored process [2025-03-17 05:44:37,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-17 05:44:37,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-17 05:44:37,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:37,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:37,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:44:37,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:37,594 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 2 proven. 114 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:44:37,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:37,730 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:37,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950015858] [2025-03-17 05:44:37,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950015858] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:37,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:37,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-17 05:44:37,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077377225] [2025-03-17 05:44:37,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:37,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:37,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:37,731 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:37,731 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:44:37,732 INFO L87 Difference]: Start difference. First operand 1383 states and 1947 transitions. Second operand has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:37,899 INFO L93 Difference]: Finished difference Result 2986 states and 4170 transitions. [2025-03-17 05:44:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:44:37,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 108 [2025-03-17 05:44:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:37,904 INFO L225 Difference]: With dead ends: 2986 [2025-03-17 05:44:37,904 INFO L226 Difference]: Without dead ends: 1996 [2025-03-17 05:44:37,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:44:37,906 INFO L435 NwaCegarLoop]: 194 mSDtfsCounter, 144 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:37,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 501 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:37,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-03-17 05:44:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1880. [2025-03-17 05:44:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1880 states, 1764 states have (on average 1.3939909297052153) internal successors, (2459), 1772 states have internal predecessors, (2459), 78 states have call successors, (78), 37 states have call predecessors, (78), 37 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 05:44:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1880 states to 1880 states and 2615 transitions. [2025-03-17 05:44:37,990 INFO L78 Accepts]: Start accepts. Automaton has 1880 states and 2615 transitions. Word has length 108 [2025-03-17 05:44:37,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:37,991 INFO L471 AbstractCegarLoop]: Abstraction has 1880 states and 2615 transitions. [2025-03-17 05:44:37,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.2) internal successors, (51), 5 states have internal predecessors, (51), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:37,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1880 states and 2615 transitions. [2025-03-17 05:44:37,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:44:37,992 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:37,993 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:38,001 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 (26)] Ended with exit code 0 [2025-03-17 05:44:38,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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-17 05:44:38,194 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:38,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:38,194 INFO L85 PathProgramCache]: Analyzing trace with hash 910435845, now seen corresponding path program 1 times [2025-03-17 05:44:38,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:38,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1385640550] [2025-03-17 05:44:38,195 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:38,195 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-17 05:44:38,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:38,198 INFO L229 MonitoredProcess]: Starting monitored process 27 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-17 05:44:38,201 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 (27)] Waiting until timeout for monitored process [2025-03-17 05:44:38,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:44:38,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:44:38,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:38,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:38,450 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-17 05:44:38,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:39,159 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 15 treesize of output 1 [2025-03-17 05:44:39,306 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 128 treesize of output 92 [2025-03-17 05:44:39,308 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 138 treesize of output 78 [2025-03-17 05:44:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:44:39,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:39,604 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:39,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1385640550] [2025-03-17 05:44:39,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1385640550] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:39,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1345572633] [2025-03-17 05:44:39,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:39,604 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:44:39,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:44:39,606 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:44:39,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2025-03-17 05:44:39,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:44:40,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:44:40,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:40,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:40,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 05:44:40,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:41,249 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 15 treesize of output 1 [2025-03-17 05:44:42,070 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 15 treesize of output 1 [2025-03-17 05:44:42,340 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 128 treesize of output 92 [2025-03-17 05:44:42,343 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 138 treesize of output 78 [2025-03-17 05:44:42,368 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 1 proven. 83 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:44:42,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:42,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1345572633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:42,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:44:42,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2025-03-17 05:44:42,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021523063] [2025-03-17 05:44:42,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:44:42,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 05:44:42,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:42,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 05:44:42,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=704, Unknown=0, NotChecked=0, Total=812 [2025-03-17 05:44:42,501 INFO L87 Difference]: Start difference. First operand 1880 states and 2615 transitions. Second operand has 24 states, 22 states have (on average 5.045454545454546) internal successors, (111), 21 states have internal predecessors, (111), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-17 05:44:45,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:45,325 INFO L93 Difference]: Finished difference Result 2977 states and 4108 transitions. [2025-03-17 05:44:45,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 05:44:45,325 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 5.045454545454546) internal successors, (111), 21 states have internal predecessors, (111), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) Word has length 109 [2025-03-17 05:44:45,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:45,332 INFO L225 Difference]: With dead ends: 2977 [2025-03-17 05:44:45,332 INFO L226 Difference]: Without dead ends: 2975 [2025-03-17 05:44:45,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 245 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=371, Invalid=1791, Unknown=0, NotChecked=0, Total=2162 [2025-03-17 05:44:45,333 INFO L435 NwaCegarLoop]: 208 mSDtfsCounter, 416 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 2758 SdHoareTripleChecker+Invalid, 1355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:45,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 2758 Invalid, 1355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-17 05:44:45,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2025-03-17 05:44:45,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2613. [2025-03-17 05:44:45,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2613 states, 2460 states have (on average 1.4052845528455284) internal successors, (3457), 2471 states have internal predecessors, (3457), 102 states have call successors, (102), 50 states have call predecessors, (102), 50 states have return successors, (102), 91 states have call predecessors, (102), 102 states have call successors, (102) [2025-03-17 05:44:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2613 states to 2613 states and 3661 transitions. [2025-03-17 05:44:45,442 INFO L78 Accepts]: Start accepts. Automaton has 2613 states and 3661 transitions. Word has length 109 [2025-03-17 05:44:45,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:45,442 INFO L471 AbstractCegarLoop]: Abstraction has 2613 states and 3661 transitions. [2025-03-17 05:44:45,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 5.045454545454546) internal successors, (111), 21 states have internal predecessors, (111), 6 states have call successors, (24), 6 states have call predecessors, (24), 6 states have return successors, (24), 4 states have call predecessors, (24), 6 states have call successors, (24) [2025-03-17 05:44:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2613 states and 3661 transitions. [2025-03-17 05:44:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:44:45,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:45,444 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:45,453 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 (27)] Ended with exit code 0 [2025-03-17 05:44:45,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2025-03-17 05:44:45,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:44:45,845 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:45,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:45,845 INFO L85 PathProgramCache]: Analyzing trace with hash -114258076, now seen corresponding path program 1 times [2025-03-17 05:44:45,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:45,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919751745] [2025-03-17 05:44:45,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:45,846 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-17 05:44:45,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:45,847 INFO L229 MonitoredProcess]: Starting monitored process 29 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-17 05:44:45,848 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 (29)] Waiting until timeout for monitored process [2025-03-17 05:44:45,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:44:46,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:44:46,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:46,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:46,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:44:46,062 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:46,108 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:44:46,108 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:44:46,108 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:46,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919751745] [2025-03-17 05:44:46,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919751745] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:46,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:46,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:44:46,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232726118] [2025-03-17 05:44:46,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:46,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:44:46,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:46,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:44:46,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:46,109 INFO L87 Difference]: Start difference. First operand 2613 states and 3661 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:44:46,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:46,338 INFO L93 Difference]: Finished difference Result 3997 states and 5568 transitions. [2025-03-17 05:44:46,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:44:46,338 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-03-17 05:44:46,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:46,343 INFO L225 Difference]: With dead ends: 3997 [2025-03-17 05:44:46,343 INFO L226 Difference]: Without dead ends: 1881 [2025-03-17 05:44:46,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:44:46,346 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 1 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:46,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 579 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:46,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1881 states. [2025-03-17 05:44:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1881 to 1837. [2025-03-17 05:44:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1719 states have (on average 1.3961605584642234) internal successors, (2400), 1727 states have internal predecessors, (2400), 78 states have call successors, (78), 39 states have call predecessors, (78), 39 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 05:44:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 2556 transitions. [2025-03-17 05:44:46,438 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 2556 transitions. Word has length 109 [2025-03-17 05:44:46,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:46,439 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 2556 transitions. [2025-03-17 05:44:46,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-17 05:44:46,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 2556 transitions. [2025-03-17 05:44:46,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:44:46,442 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:46,442 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:46,450 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 (29)] Ended with exit code 0 [2025-03-17 05:44:46,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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-17 05:44:46,643 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:46,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:46,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1235077185, now seen corresponding path program 1 times [2025-03-17 05:44:46,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:46,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [864932850] [2025-03-17 05:44:46,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:46,644 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-17 05:44:46,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:46,646 INFO L229 MonitoredProcess]: Starting monitored process 30 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-17 05:44:46,648 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 (30)] Waiting until timeout for monitored process [2025-03-17 05:44:46,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:44:46,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:44:46,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:46,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:46,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 05:44:46,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:47,939 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 28 treesize of output 24 [2025-03-17 05:44:48,207 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 33 treesize of output 25 [2025-03-17 05:44:48,329 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 88 treesize of output 68 [2025-03-17 05:44:48,331 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 72 treesize of output 52 [2025-03-17 05:44:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 8 proven. 188 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-03-17 05:44:48,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:49,121 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:49,121 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:49,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [864932850] [2025-03-17 05:44:49,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [864932850] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:49,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:49,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [23] total 31 [2025-03-17 05:44:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534388598] [2025-03-17 05:44:49,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:49,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 05:44:49,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:49,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 05:44:49,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=835, Unknown=0, NotChecked=0, Total=930 [2025-03-17 05:44:49,122 INFO L87 Difference]: Start difference. First operand 1837 states and 2556 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:49,909 INFO L93 Difference]: Finished difference Result 3483 states and 4817 transitions. [2025-03-17 05:44:49,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 05:44:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-17 05:44:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:49,919 INFO L225 Difference]: With dead ends: 3483 [2025-03-17 05:44:49,919 INFO L226 Difference]: Without dead ends: 2153 [2025-03-17 05:44:49,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=119, Invalid=1141, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 05:44:49,922 INFO L435 NwaCegarLoop]: 181 mSDtfsCounter, 75 mSDsluCounter, 1225 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 1406 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:49,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 1406 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 05:44:49,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2153 states. [2025-03-17 05:44:50,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2153 to 1844. [2025-03-17 05:44:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1726 states have (on average 1.3986095017381228) internal successors, (2414), 1734 states have internal predecessors, (2414), 78 states have call successors, (78), 39 states have call predecessors, (78), 39 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 05:44:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2570 transitions. [2025-03-17 05:44:50,014 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2570 transitions. Word has length 109 [2025-03-17 05:44:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:50,014 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2570 transitions. [2025-03-17 05:44:50,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2570 transitions. [2025-03-17 05:44:50,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:44:50,016 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:50,016 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:50,025 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 (30)] Ended with exit code 0 [2025-03-17 05:44:50,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-17 05:44:50,217 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:50,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:50,218 INFO L85 PathProgramCache]: Analyzing trace with hash -561874174, now seen corresponding path program 1 times [2025-03-17 05:44:50,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:50,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823801742] [2025-03-17 05:44:50,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:50,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-17 05:44:50,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:50,220 INFO L229 MonitoredProcess]: Starting monitored process 31 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-17 05:44:50,221 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 (31)] Waiting until timeout for monitored process [2025-03-17 05:44:50,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:44:50,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:44:50,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:50,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:50,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:44:50,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:50,752 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 33 treesize of output 25 [2025-03-17 05:44:50,755 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 29 treesize of output 21 [2025-03-17 05:44:50,761 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 25 treesize of output 17 [2025-03-17 05:44:50,811 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:44:50,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:51,031 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:51,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823801742] [2025-03-17 05:44:51,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823801742] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:51,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:51,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:44:51,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163935502] [2025-03-17 05:44:51,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:51,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:51,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:51,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:51,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:44:51,032 INFO L87 Difference]: Start difference. First operand 1844 states and 2570 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:51,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:51,371 INFO L93 Difference]: Finished difference Result 3422 states and 4747 transitions. [2025-03-17 05:44:51,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:44:51,372 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 109 [2025-03-17 05:44:51,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:51,377 INFO L225 Difference]: With dead ends: 3422 [2025-03-17 05:44:51,377 INFO L226 Difference]: Without dead ends: 2085 [2025-03-17 05:44:51,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:44:51,380 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 122 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:51,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 458 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:44:51,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2025-03-17 05:44:51,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1844. [2025-03-17 05:44:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1726 states have (on average 1.3939745075318657) internal successors, (2406), 1734 states have internal predecessors, (2406), 78 states have call successors, (78), 39 states have call predecessors, (78), 39 states have return successors, (78), 70 states have call predecessors, (78), 78 states have call successors, (78) [2025-03-17 05:44:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2562 transitions. [2025-03-17 05:44:51,476 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2562 transitions. Word has length 109 [2025-03-17 05:44:51,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:51,476 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2562 transitions. [2025-03-17 05:44:51,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2025-03-17 05:44:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2562 transitions. [2025-03-17 05:44:51,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-17 05:44:51,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:51,477 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:51,486 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 (31)] Ended with exit code 0 [2025-03-17 05:44:51,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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-17 05:44:51,678 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:51,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:51,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1266096992, now seen corresponding path program 1 times [2025-03-17 05:44:51,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:44:51,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1025871197] [2025-03-17 05:44:51,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:51,679 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-17 05:44:51,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:44:51,681 INFO L229 MonitoredProcess]: Starting monitored process 32 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-17 05:44:51,683 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 (32)] Waiting until timeout for monitored process [2025-03-17 05:44:51,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-17 05:44:51,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-17 05:44:51,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:51,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:51,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-17 05:44:51,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:52,223 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 33 treesize of output 25 [2025-03-17 05:44:52,226 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 29 treesize of output 21 [2025-03-17 05:44:52,229 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 25 treesize of output 17 [2025-03-17 05:44:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-17 05:44:52,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:44:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-17 05:44:52,428 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:44:52,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1025871197] [2025-03-17 05:44:52,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1025871197] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:52,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:52,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-17 05:44:52,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155078919] [2025-03-17 05:44:52,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:52,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:52,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:44:52,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:52,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:44:52,429 INFO L87 Difference]: Start difference. First operand 1844 states and 2562 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12)