./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.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-31.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 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:44:48,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:44:48,710 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 05:44:48,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:44:48,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:44:48,738 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:44:48,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:44:48,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:44:48,739 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:44:48,739 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:44:48,739 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:44:48,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:44:48,740 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:44:48,740 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:44:48,740 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:44:48,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:44:48,740 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:44:48,740 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:44:48,740 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 05:44:48,740 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:44:48,741 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:44:48,741 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:44:48,741 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:44:48,741 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:44:48,741 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:44:48,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:44:48,741 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:44:48,741 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:44:48,741 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:44:48,741 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:44:48,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:44:48,742 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:44:48,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:44:48,742 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:44:48,742 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:44:48,742 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:44:48,742 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:44:48,742 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 05:44:48,742 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 05:44:48,743 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:44:48,743 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:44:48,743 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:44:48,743 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:44:48,743 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 -> 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 [2025-03-17 05:44:48,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:44:48,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:44:48,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:44:48,986 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:44:48,986 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:44:48,987 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-31.i [2025-03-17 05:44:50,285 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf025e0f3/103058b1e6e34b46b55366db6751fc0e/FLAG9641fa7fa [2025-03-17 05:44:50,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:44:50,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.i [2025-03-17 05:44:50,567 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf025e0f3/103058b1e6e34b46b55366db6751fc0e/FLAG9641fa7fa [2025-03-17 05:44:50,872 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf025e0f3/103058b1e6e34b46b55366db6751fc0e [2025-03-17 05:44:50,875 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:44:50,876 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:44:50,877 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:44:50,877 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:44:50,880 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:44:50,881 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:44:50" (1/1) ... [2025-03-17 05:44:50,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bcc66c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:50, skipping insertion in model container [2025-03-17 05:44:50,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:44:50" (1/1) ... [2025-03-17 05:44:50,901 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:44:51,014 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-31.i[916,929] [2025-03-17 05:44:51,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:44:51,075 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:44:51,082 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-31.i[916,929] [2025-03-17 05:44:51,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:44:51,129 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:44:51,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51 WrapperNode [2025-03-17 05:44:51,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:44:51,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:44:51,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:44:51,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:44:51,136 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:44:51" (1/1) ... [2025-03-17 05:44:51,142 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:44:51" (1/1) ... [2025-03-17 05:44:51,169 INFO L138 Inliner]: procedures = 29, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 434 [2025-03-17 05:44:51,169 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:44:51,170 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:44:51,170 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:44:51,170 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:44:51,176 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,178 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,191 INFO L175 MemorySlicer]: Split 110 memory accesses to 11 slices as follows [2, 5, 8, 16, 12, 6, 6, 25, 8, 10, 12]. 23 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 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 2, 1, 4, 1]. [2025-03-17 05:44:51,191 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,214 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:44:51,217 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:44:51,217 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:44:51,217 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:44:51,218 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (1/1) ... [2025-03-17 05:44:51,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:44:51,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:51,246 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:44:51,251 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:44:51,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:44:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-17 05:44:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-17 05:44:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-17 05:44:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-17 05:44:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-17 05:44:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-17 05:44:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-17 05:44:51,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-17 05:44:51,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-17 05:44:51,267 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:44:51,270 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-17 05:44:51,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:44:51,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:44:51,425 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:44:51,427 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:44:51,703 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-03-17 05:44:51,741 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-17 05:44:51,741 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:44:51,751 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:44:51,751 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:44:51,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:44:51 BoogieIcfgContainer [2025-03-17 05:44:51,752 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:44:51,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:44:51,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:44:51,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:44:51,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:44:50" (1/3) ... [2025-03-17 05:44:51,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bae1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:44:51, skipping insertion in model container [2025-03-17 05:44:51,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:44:51" (2/3) ... [2025-03-17 05:44:51,759 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64bae1ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:44:51, skipping insertion in model container [2025-03-17 05:44:51,759 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:44:51" (3/3) ... [2025-03-17 05:44:51,760 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-31.i [2025-03-17 05:44:51,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:44:51,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-31.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:44:51,818 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:44:51,825 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;@5f320465, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:44:51,826 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:44:51,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:44:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:44:51,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:51,837 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:51,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:51,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:51,841 INFO L85 PathProgramCache]: Analyzing trace with hash -957346802, now seen corresponding path program 1 times [2025-03-17 05:44:51,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:51,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719679981] [2025-03-17 05:44:51,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:51,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:51,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:44:51,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:44:51,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:51,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:52,106 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:44:52,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:52,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719679981] [2025-03-17 05:44:52,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719679981] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:44:52,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [493706295] [2025-03-17 05:44:52,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:52,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:52,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:52,112 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:44:52,114 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:44:52,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:44:52,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:44:52,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:52,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:52,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:44:52,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:52,312 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-17 05:44:52,313 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:44:52,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [493706295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:52,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:44:52,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 05:44:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787693288] [2025-03-17 05:44:52,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:52,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:44:52,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:52,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:44:52,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:44:52,336 INFO L87 Difference]: Start difference. First operand has 81 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:44:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:52,351 INFO L93 Difference]: Finished difference Result 159 states and 251 transitions. [2025-03-17 05:44:52,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:44:52,352 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2025-03-17 05:44:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:52,357 INFO L225 Difference]: With dead ends: 159 [2025-03-17 05:44:52,357 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 05:44:52,359 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 91 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:44:52,361 INFO L435 NwaCegarLoop]: 117 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, 117 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:44:52,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:44:52,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 05:44:52,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 05:44:52,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:44:52,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 117 transitions. [2025-03-17 05:44:52,391 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 117 transitions. Word has length 90 [2025-03-17 05:44:52,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:52,392 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 117 transitions. [2025-03-17 05:44:52,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:44:52,392 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 117 transitions. [2025-03-17 05:44:52,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:44:52,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:52,395 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:52,403 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 05:44:52,596 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:44:52,596 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:52,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash 522383813, now seen corresponding path program 1 times [2025-03-17 05:44:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:52,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498890616] [2025-03-17 05:44:52,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:52,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:52,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:44:52,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:44:52,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:52,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:52,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:52,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498890616] [2025-03-17 05:44:52,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498890616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:52,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:52,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:44:52,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890554600] [2025-03-17 05:44:52,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:52,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:44:52,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:52,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:44:52,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:44:52,936 INFO L87 Difference]: Start difference. First operand 79 states and 117 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:52,957 INFO L93 Difference]: Finished difference Result 157 states and 233 transitions. [2025-03-17 05:44:52,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:44:52,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2025-03-17 05:44:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:52,960 INFO L225 Difference]: With dead ends: 157 [2025-03-17 05:44:52,961 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 05:44:52,962 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:44:52,963 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:52,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 227 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:44:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 05:44:52,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-17 05:44:52,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:44:52,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 116 transitions. [2025-03-17 05:44:52,974 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 116 transitions. Word has length 90 [2025-03-17 05:44:52,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:52,975 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 116 transitions. [2025-03-17 05:44:52,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 116 transitions. [2025-03-17 05:44:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:44:52,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:52,978 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:52,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 05:44:52,978 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:52,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:52,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1875693510, now seen corresponding path program 1 times [2025-03-17 05:44:52,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:52,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441304192] [2025-03-17 05:44:52,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:52,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:53,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:44:53,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:44:53,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:53,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:54,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:54,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441304192] [2025-03-17 05:44:54,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441304192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:54,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:54,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:44:54,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390676506] [2025-03-17 05:44:54,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:54,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:44:54,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:54,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:44:54,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:54,216 INFO L87 Difference]: Start difference. First operand 79 states and 116 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:54,388 INFO L93 Difference]: Finished difference Result 200 states and 290 transitions. [2025-03-17 05:44:54,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:44:54,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2025-03-17 05:44:54,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:54,396 INFO L225 Difference]: With dead ends: 200 [2025-03-17 05:44:54,396 INFO L226 Difference]: Without dead ends: 122 [2025-03-17 05:44:54,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-17 05:44:54,397 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:54,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 526 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:54,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-17 05:44:54,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2025-03-17 05:44:54,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:44:54,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2025-03-17 05:44:54,405 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 90 [2025-03-17 05:44:54,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:54,406 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2025-03-17 05:44:54,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:54,406 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2025-03-17 05:44:54,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:44:54,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:54,407 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:54,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 05:44:54,407 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:54,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:54,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1641052124, now seen corresponding path program 1 times [2025-03-17 05:44:54,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:54,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190758715] [2025-03-17 05:44:54,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:54,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:54,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:44:54,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:44:54,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:54,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:54,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:54,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190758715] [2025-03-17 05:44:54,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190758715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:54,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:54,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:44:54,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271293403] [2025-03-17 05:44:54,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:54,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:44:54,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:54,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:44:54,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:44:54,655 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:54,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:54,685 INFO L93 Difference]: Finished difference Result 237 states and 343 transitions. [2025-03-17 05:44:54,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:44:54,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2025-03-17 05:44:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:54,688 INFO L225 Difference]: With dead ends: 237 [2025-03-17 05:44:54,691 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 05:44:54,691 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:54,692 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:54,692 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 320 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:44:54,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 05:44:54,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2025-03-17 05:44:54,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 104 states have internal predecessors, (144), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:44:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 170 transitions. [2025-03-17 05:44:54,707 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 170 transitions. Word has length 92 [2025-03-17 05:44:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:54,707 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 170 transitions. [2025-03-17 05:44:54,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:54,708 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 170 transitions. [2025-03-17 05:44:54,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:44:54,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:54,712 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:54,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 05:44:54,712 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:54,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:54,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1837565629, now seen corresponding path program 1 times [2025-03-17 05:44:54,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:54,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904285844] [2025-03-17 05:44:54,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:54,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:54,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:44:54,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:44:54,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:54,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:55,092 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:55,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:55,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904285844] [2025-03-17 05:44:55,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904285844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:55,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:55,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:44:55,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478369976] [2025-03-17 05:44:55,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:55,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:44:55,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:55,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:44:55,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:55,094 INFO L87 Difference]: Start difference. First operand 119 states and 170 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:55,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:55,190 INFO L93 Difference]: Finished difference Result 250 states and 355 transitions. [2025-03-17 05:44:55,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:44:55,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2025-03-17 05:44:55,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:55,192 INFO L225 Difference]: With dead ends: 250 [2025-03-17 05:44:55,192 INFO L226 Difference]: Without dead ends: 132 [2025-03-17 05:44:55,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:44:55,193 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 64 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:55,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 463 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:55,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-03-17 05:44:55,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 93. [2025-03-17 05:44:55,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 78 states have internal predecessors, (105), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:44:55,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2025-03-17 05:44:55,212 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 92 [2025-03-17 05:44:55,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:55,213 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2025-03-17 05:44:55,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:55,213 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2025-03-17 05:44:55,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:44:55,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:55,215 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:55,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 05:44:55,216 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:55,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:55,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1744683049, now seen corresponding path program 1 times [2025-03-17 05:44:55,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:55,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325907290] [2025-03-17 05:44:55,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:55,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:55,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:44:55,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:44:55,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:55,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:55,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:55,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325907290] [2025-03-17 05:44:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325907290] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:55,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:44:55,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525530233] [2025-03-17 05:44:55,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:55,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:55,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:55,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:55,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:44:55,368 INFO L87 Difference]: Start difference. First operand 93 states and 131 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:55,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:55,494 INFO L93 Difference]: Finished difference Result 214 states and 300 transitions. [2025-03-17 05:44:55,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:44:55,495 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2025-03-17 05:44:55,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:55,496 INFO L225 Difference]: With dead ends: 214 [2025-03-17 05:44:55,497 INFO L226 Difference]: Without dead ends: 126 [2025-03-17 05:44:55,497 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:55,498 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 46 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:55,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 547 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-17 05:44:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2025-03-17 05:44:55,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3506493506493507) internal successors, (104), 78 states have internal predecessors, (104), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:44:55,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 130 transitions. [2025-03-17 05:44:55,578 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 130 transitions. Word has length 92 [2025-03-17 05:44:55,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:55,579 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 130 transitions. [2025-03-17 05:44:55,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:55,579 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 130 transitions. [2025-03-17 05:44:55,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:44:55,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:55,579 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:55,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 05:44:55,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:55,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:55,580 INFO L85 PathProgramCache]: Analyzing trace with hash 441469495, now seen corresponding path program 1 times [2025-03-17 05:44:55,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:55,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472825696] [2025-03-17 05:44:55,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:55,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:55,617 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:44:55,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:44:55,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:55,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:55,773 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:55,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:55,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472825696] [2025-03-17 05:44:55,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472825696] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:55,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:55,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:44:55,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761258279] [2025-03-17 05:44:55,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:55,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:55,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:55,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:55,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:44:55,776 INFO L87 Difference]: Start difference. First operand 93 states and 130 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:55,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:55,836 INFO L93 Difference]: Finished difference Result 207 states and 287 transitions. [2025-03-17 05:44:55,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:44:55,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2025-03-17 05:44:55,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:55,837 INFO L225 Difference]: With dead ends: 207 [2025-03-17 05:44:55,837 INFO L226 Difference]: Without dead ends: 119 [2025-03-17 05:44:55,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:55,838 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 37 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:55,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 426 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:44:55,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2025-03-17 05:44:55,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 93. [2025-03-17 05:44:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 78 states have internal predecessors, (103), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:44:55,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 129 transitions. [2025-03-17 05:44:55,848 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 129 transitions. Word has length 93 [2025-03-17 05:44:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:55,849 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 129 transitions. [2025-03-17 05:44:55,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:55,849 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 129 transitions. [2025-03-17 05:44:55,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:44:55,850 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:55,850 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:55,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 05:44:55,850 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:55,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:55,850 INFO L85 PathProgramCache]: Analyzing trace with hash 91801051, now seen corresponding path program 1 times [2025-03-17 05:44:55,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:55,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590607961] [2025-03-17 05:44:55,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:55,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:55,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:44:55,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:44:55,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:55,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:56,349 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:56,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:56,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590607961] [2025-03-17 05:44:56,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590607961] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:56,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:56,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 05:44:56,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927193133] [2025-03-17 05:44:56,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:56,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 05:44:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:56,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 05:44:56,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-17 05:44:56,352 INFO L87 Difference]: Start difference. First operand 93 states and 129 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:56,524 INFO L93 Difference]: Finished difference Result 258 states and 354 transitions. [2025-03-17 05:44:56,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:44:56,525 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-17 05:44:56,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:56,526 INFO L225 Difference]: With dead ends: 258 [2025-03-17 05:44:56,526 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 05:44:56,527 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-17 05:44:56,527 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 79 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:56,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 728 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:56,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 05:44:56,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 167. [2025-03-17 05:44:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 141 states have (on average 1.326241134751773) internal successors, (187), 143 states have internal predecessors, (187), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:44:56,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 229 transitions. [2025-03-17 05:44:56,537 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 229 transitions. Word has length 94 [2025-03-17 05:44:56,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:56,537 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 229 transitions. [2025-03-17 05:44:56,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:56,537 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 229 transitions. [2025-03-17 05:44:56,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:44:56,538 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:56,538 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:56,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 05:44:56,539 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:56,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:56,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1306708080, now seen corresponding path program 1 times [2025-03-17 05:44:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:56,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249448907] [2025-03-17 05:44:56,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:56,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:44:56,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:44:56,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:56,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:44:56,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1698404397] [2025-03-17 05:44:56,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:56,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:56,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:56,618 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:44:56,620 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:44:56,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:44:56,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:44:56,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:56,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:56,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:44:56,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:44:56,878 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:56,882 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:44:56,893 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:56,894 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:44:56,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:56,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249448907] [2025-03-17 05:44:56,894 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 05:44:56,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698404397] [2025-03-17 05:44:56,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698404397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:56,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:56,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:44:56,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763010436] [2025-03-17 05:44:56,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:56,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:56,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:56,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:44:56,896 INFO L87 Difference]: Start difference. First operand 167 states and 229 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:56,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:56,976 INFO L93 Difference]: Finished difference Result 379 states and 520 transitions. [2025-03-17 05:44:56,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:44:56,976 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2025-03-17 05:44:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:56,977 INFO L225 Difference]: With dead ends: 379 [2025-03-17 05:44:56,977 INFO L226 Difference]: Without dead ends: 217 [2025-03-17 05:44:56,978 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:56,978 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 52 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:56,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 548 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2025-03-17 05:44:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 196. [2025-03-17 05:44:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 170 states have (on average 1.3294117647058823) internal successors, (226), 172 states have internal predecessors, (226), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:44:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 268 transitions. [2025-03-17 05:44:56,994 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 268 transitions. Word has length 95 [2025-03-17 05:44:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:56,995 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 268 transitions. [2025-03-17 05:44:56,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:56,995 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 268 transitions. [2025-03-17 05:44:56,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:44:56,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:56,996 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:57,003 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 05:44:57,196 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,SelfDestructingSolverStorable8 [2025-03-17 05:44:57,197 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:57,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:57,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1634097908, now seen corresponding path program 1 times [2025-03-17 05:44:57,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:57,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995114177] [2025-03-17 05:44:57,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:57,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:57,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:44:57,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:44:57,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:57,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:57,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995114177] [2025-03-17 05:44:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995114177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:57,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:57,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:44:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853641268] [2025-03-17 05:44:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:57,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:44:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:57,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:44:57,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:57,367 INFO L87 Difference]: Start difference. First operand 196 states and 268 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:57,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:57,460 INFO L93 Difference]: Finished difference Result 491 states and 663 transitions. [2025-03-17 05:44:57,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:44:57,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2025-03-17 05:44:57,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:57,462 INFO L225 Difference]: With dead ends: 491 [2025-03-17 05:44:57,462 INFO L226 Difference]: Without dead ends: 300 [2025-03-17 05:44:57,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 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:44:57,462 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 48 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:57,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 680 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:57,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2025-03-17 05:44:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 211. [2025-03-17 05:44:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 185 states have (on average 1.335135135135135) internal successors, (247), 187 states have internal predecessors, (247), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:44:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 289 transitions. [2025-03-17 05:44:57,479 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 289 transitions. Word has length 95 [2025-03-17 05:44:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:57,480 INFO L471 AbstractCegarLoop]: Abstraction has 211 states and 289 transitions. [2025-03-17 05:44:57,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 289 transitions. [2025-03-17 05:44:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:44:57,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:57,480 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:57,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 05:44:57,481 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash 1123563731, now seen corresponding path program 1 times [2025-03-17 05:44:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676177095] [2025-03-17 05:44:57,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:57,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:44:57,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:44:57,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:57,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:57,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676177095] [2025-03-17 05:44:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676177095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:44:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51068964] [2025-03-17 05:44:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:57,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:57,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:57,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:57,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:44:57,649 INFO L87 Difference]: Start difference. First operand 211 states and 289 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:57,743 INFO L93 Difference]: Finished difference Result 525 states and 711 transitions. [2025-03-17 05:44:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:44:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2025-03-17 05:44:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:57,746 INFO L225 Difference]: With dead ends: 525 [2025-03-17 05:44:57,746 INFO L226 Difference]: Without dead ends: 319 [2025-03-17 05:44:57,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:57,748 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 48 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:57,749 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 461 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:57,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-17 05:44:57,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 222. [2025-03-17 05:44:57,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 198 states have (on average 1.3434343434343434) internal successors, (266), 199 states have internal predecessors, (266), 19 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-17 05:44:57,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 304 transitions. [2025-03-17 05:44:57,765 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 304 transitions. Word has length 95 [2025-03-17 05:44:57,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:57,765 INFO L471 AbstractCegarLoop]: Abstraction has 222 states and 304 transitions. [2025-03-17 05:44:57,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:57,765 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 304 transitions. [2025-03-17 05:44:57,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:44:57,767 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:57,767 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:57,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 05:44:57,767 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:57,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:57,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1818093868, now seen corresponding path program 1 times [2025-03-17 05:44:57,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:57,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655164545] [2025-03-17 05:44:57,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:57,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:57,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:44:57,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:44:57,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:57,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:44:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:44:57,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 05:44:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655164545] [2025-03-17 05:44:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655164545] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:44:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:44:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 05:44:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63097738] [2025-03-17 05:44:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:44:57,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:44:57,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 05:44:57,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:44:57,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 05:44:57,918 INFO L87 Difference]: Start difference. First operand 222 states and 304 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:44:57,994 INFO L93 Difference]: Finished difference Result 539 states and 717 transitions. [2025-03-17 05:44:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:44:57,995 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2025-03-17 05:44:57,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:44:57,996 INFO L225 Difference]: With dead ends: 539 [2025-03-17 05:44:57,996 INFO L226 Difference]: Without dead ends: 318 [2025-03-17 05:44:57,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:44:57,997 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 102 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:44:57,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 377 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:44:57,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-03-17 05:44:58,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 302. [2025-03-17 05:44:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 266 states have (on average 1.2744360902255638) internal successors, (339), 269 states have internal predecessors, (339), 27 states have call successors, (27), 8 states have call predecessors, (27), 8 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2025-03-17 05:44:58,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 393 transitions. [2025-03-17 05:44:58,017 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 393 transitions. Word has length 95 [2025-03-17 05:44:58,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:44:58,017 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 393 transitions. [2025-03-17 05:44:58,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:44:58,018 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 393 transitions. [2025-03-17 05:44:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:44:58,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:44:58,018 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:58,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 05:44:58,018 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:44:58,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:44:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1752727248, now seen corresponding path program 1 times [2025-03-17 05:44:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 05:44:58,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124106526] [2025-03-17 05:44:58,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:58,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 05:44:58,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:44:58,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:44:58,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:58,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 05:44:58,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [140817684] [2025-03-17 05:44:58,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:44:58,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:58,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:44:58,115 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:44:58,117 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:44:58,239 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:44:58,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:44:58,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:58,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:44:58,368 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 05:44:58,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:44:58,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:44:58,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:44:58,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 05:44:58,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 05:44:58,548 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 05:44:58,549 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-17 05:44:58,560 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:44:58,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 05:44:58,754 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:44:58,851 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 05:44:58,853 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 05:44:58 BoogieIcfgContainer [2025-03-17 05:44:58,854 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 05:44:58,854 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 05:44:58,854 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 05:44:58,854 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 05:44:58,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:44:51" (3/4) ... [2025-03-17 05:44:58,858 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-17 05:44:58,859 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 05:44:58,859 INFO L158 Benchmark]: Toolchain (without parser) took 7983.30ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 112.9MB in the beginning and 122.6MB in the end (delta: -9.7MB). Peak memory consumption was 74.6MB. Max. memory is 16.1GB. [2025-03-17 05:44:58,859 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:44:58,859 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.47ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.2MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:44:58,859 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.49ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 96.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 05:44:58,860 INFO L158 Benchmark]: Boogie Preprocessor took 46.77ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 92.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:44:58,860 INFO L158 Benchmark]: IcfgBuilder took 534.73ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 59.7MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-17 05:44:58,860 INFO L158 Benchmark]: TraceAbstraction took 7100.30ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 58.7MB in the beginning and 122.7MB in the end (delta: -64.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. [2025-03-17 05:44:58,860 INFO L158 Benchmark]: Witness Printer took 4.47ms. Allocated memory is still 226.5MB. Free memory was 122.7MB in the beginning and 122.6MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 05:44:58,861 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.23ms. Allocated memory is still 201.3MB. Free memory is still 122.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.47ms. Allocated memory is still 142.6MB. Free memory was 112.9MB in the beginning and 99.2MB in the end (delta: 13.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.49ms. Allocated memory is still 142.6MB. Free memory was 99.2MB in the beginning and 96.2MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.77ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 92.2MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 534.73ms. Allocated memory is still 142.6MB. Free memory was 92.2MB in the beginning and 59.7MB in the end (delta: 32.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 7100.30ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 58.7MB in the beginning and 122.7MB in the end (delta: -64.0MB). Peak memory consumption was 24.3MB. Max. memory is 16.1GB. * Witness Printer took 4.47ms. Allocated memory is still 226.5MB. Free memory was 122.7MB in the beginning and 122.6MB in the end (delta: 45.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 99, overapproximation of someBinaryDOUBLEComparisonOperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L22] signed long int var_1_1 = 200; [L23] signed long int* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_2 = 0; [L24] unsigned char var_1_2 = 0; [L25] unsigned char* var_1_2_Pointer = &(var_1_2); [L26] signed long int var_1_3 = 1107940323; [L26] signed long int var_1_3 = 1107940323; [L27] signed long int* var_1_3_Pointer = &(var_1_3); [L28] unsigned char var_1_6 = 0; [L28] unsigned char var_1_6 = 0; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] signed long int var_1_7 = 4; [L30] signed long int var_1_7 = 4; [L31] signed long int* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = -32; [L32] signed long int var_1_8 = -32; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] unsigned char var_1_9 = 64; [L34] unsigned char var_1_9 = 64; [L35] unsigned char* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_12 = 4; [L36] unsigned char var_1_12 = 4; [L37] unsigned char* var_1_12_Pointer = &(var_1_12); [L38] double var_1_13 = 0.97; [L38] double var_1_13 = 0.97; [L39] double* var_1_13_Pointer = &(var_1_13); [L40] double var_1_14 = 32.6; [L40] double var_1_14 = 32.6; [L41] double* var_1_14_Pointer = &(var_1_14); [L42] signed long int last_1_var_1_7 = 4; [L43] double last_1_var_1_13 = 0.97; [L110] isInitial = 1 [L111] FCALL initially() [L112] COND TRUE 1 [L113] CALL updateLastVariables() [L102] EXPR \read(var_1_7) [L102] last_1_var_1_7 = var_1_7 [L103] EXPR \read(var_1_13) [L103] last_1_var_1_13 = var_1_13 [L113] RET updateLastVariables() [L114] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] EXPR \read(var_1_2) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L85] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L86] var_1_3 = __VERIFIER_nondet_long() [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_6 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_8 = __VERIFIER_nondet_long() [L93] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_12 = __VERIFIER_nondet_uchar() [L96] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] var_1_14 = __VERIFIER_nondet_double() [L99] EXPR \read(var_1_14) [L99] EXPR var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F [L99] EXPR \read(var_1_14) [L99] EXPR var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] EXPR (var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] RET updateVariables() [L115] CALL step() [L47] EXPR \read(*var_1_3_Pointer) [L47] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L47] COND FALSE !(! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) [L54] EXPR \read(*var_1_12_Pointer) [L54] (*(var_1_9_Pointer)) = (*(var_1_12_Pointer)) [L56] EXPR \read(*var_1_9_Pointer) [L56] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L56] COND FALSE !((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) [L59] EXPR \read(*var_1_9_Pointer) [L59] EXPR \read(*var_1_3_Pointer) [L59] (*(var_1_7_Pointer)) = ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))) [L61] EXPR \read(*var_1_9_Pointer) [L61] EXPR \read(*var_1_3_Pointer) [L61] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L61] COND FALSE !(((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) [L72] EXPR \read(*var_1_14_Pointer) [L72] (*(var_1_13_Pointer)) = (*(var_1_14_Pointer)) [L74] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L74] COND TRUE (*(var_1_2_Pointer)) [L75] EXPR \read(*var_1_3_Pointer) [L75] EXPR \read(*var_1_9_Pointer) [L75] EXPR \read(*var_1_9_Pointer) [L75] (*(var_1_1_Pointer)) = (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))) [L115] RET step() [L116] CALL, EXPR property() [L106] EXPR \read(*var_1_2_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1) [L106] EXPR \read(*var_1_1_Pointer) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR (*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer)))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer)))))) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))) [L106] EXPR \read(*var_1_7_Pointer) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR ((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer)))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_12_Pointer) [L106] EXPR (! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) [L106] EXPR \read(*var_1_9_Pointer) [L106] EXPR \read(*var_1_3_Pointer) [L106] EXPR \read(*var_1_9_Pointer) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR (((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer)))) [L106] EXPR \read(*var_1_13_Pointer) [L106] EXPR \read(*var_1_14_Pointer) [L106] EXPR (((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer)))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106-L107] return ((((*(var_1_2_Pointer)) ? ((*(var_1_1_Pointer)) == ((signed long int) (((*(var_1_3_Pointer)) - (*(var_1_9_Pointer))) - (*(var_1_9_Pointer))))) : (((*(var_1_6_Pointer)) && ((*(var_1_3_Pointer)) < (*(var_1_9_Pointer)))) ? ((*(var_1_1_Pointer)) == ((signed long int) (*(var_1_3_Pointer)))) : 1)) && (((*(var_1_9_Pointer)) < (*(var_1_9_Pointer))) ? ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) + (*(var_1_9_Pointer))))) : ((*(var_1_7_Pointer)) == ((signed long int) ((*(var_1_9_Pointer)) - (*(var_1_3_Pointer))))))) && ((! ((*(var_1_3_Pointer)) < ((*(var_1_8_Pointer)) * last_1_var_1_7))) ? ((((((last_1_var_1_13) < 0 ) ? -(last_1_var_1_13) : (last_1_var_1_13))) < last_1_var_1_13) ? ((*(var_1_6_Pointer)) ? ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))) : 1) : 1) : ((*(var_1_9_Pointer)) == ((unsigned char) (*(var_1_12_Pointer)))))) && ((((*(var_1_9_Pointer)) + (*(var_1_3_Pointer))) < (*(var_1_9_Pointer))) ? (((*(var_1_2_Pointer)) && (*(var_1_6_Pointer))) ? ((*(var_1_6_Pointer)) ? ((*(var_1_13_Pointer)) == ((double) 0.8)) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) : ((*(var_1_13_Pointer)) == ((double) (*(var_1_14_Pointer))))) ; [L116] RET, EXPR property() [L116] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=97/100, last_1_var_1_7=4, var_1_12={11:0}, var_1_12_Pointer={11:0}, var_1_13={12:0}, var_1_13_Pointer={12:0}, var_1_14={13:0}, var_1_14_Pointer={13:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_2={5:0}, var_1_2_Pointer={5:0}, var_1_3={6:0}, var_1_3_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 132 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.0s, OverallIterations: 13, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 532 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 532 mSDsluCounter, 5420 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3849 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 717 IncrementalHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1571 mSDtfsCounter, 717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=302occurred in iteration=12, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 327 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 1490 NumberOfCodeBlocks, 1490 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1190 ConstructedInterpolants, 0 QuantifiedInterpolants, 1981 SizeOfPredicates, 6 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 2840/2860 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:44:58,877 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-31.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 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 05:45:00,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 05:45:00,919 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-17 05:45:00,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 05:45:00,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 05:45:00,945 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 05:45:00,946 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 05:45:00,946 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 05:45:00,946 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 05:45:00,946 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 05:45:00,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 05:45:00,947 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 05:45:00,947 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 05:45:00,947 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 05:45:00,948 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 05:45:00,948 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 05:45:00,948 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 05:45:00,948 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 05:45:00,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 05:45:00,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 05:45:00,949 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 05:45:00,950 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 05:45:00,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 05:45:00,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 05:45:00,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 05:45:00,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:45:00,950 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 05:45:00,950 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 05:45:00,950 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 05:45:00,951 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 05:45:00,951 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-17 05:45:00,951 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:00,951 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 05:45:00,951 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 05:45:00,951 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 05:45:00,951 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 05:45:00,951 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 -> 08a905a57e2510263318b707c70f3b678c7204182c8cd0b9b57e46d4fa7b9fa2 [2025-03-17 05:45:01,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 05:45:01,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 05:45:01,213 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 05:45:01,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 05:45:01,214 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 05:45:01,215 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-31.i [2025-03-17 05:45:02,445 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b526dc17e/ff230370d927416c8b2d8429742d5517/FLAGa8370dba8 [2025-03-17 05:45:02,631 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 05:45:02,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-31.i [2025-03-17 05:45:02,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b526dc17e/ff230370d927416c8b2d8429742d5517/FLAGa8370dba8 [2025-03-17 05:45:02,658 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b526dc17e/ff230370d927416c8b2d8429742d5517 [2025-03-17 05:45:02,660 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 05:45:02,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 05:45:02,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 05:45:02,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 05:45:02,666 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 05:45:02,667 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:02,668 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771c4c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02, skipping insertion in model container [2025-03-17 05:45:02,669 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:02,682 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 05:45:02,791 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-31.i[916,929] [2025-03-17 05:45:02,838 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:45:02,853 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 05:45:02,863 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-31.i[916,929] [2025-03-17 05:45:02,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 05:45:02,898 INFO L204 MainTranslator]: Completed translation [2025-03-17 05:45:02,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02 WrapperNode [2025-03-17 05:45:02,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 05:45:02,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 05:45:02,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 05:45:02,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 05:45:02,905 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:45:02" (1/1) ... [2025-03-17 05:45:02,919 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:45:02" (1/1) ... [2025-03-17 05:45:02,951 INFO L138 Inliner]: procedures = 33, calls = 142, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 432 [2025-03-17 05:45:02,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 05:45:02,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 05:45:02,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 05:45:02,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 05:45:02,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:02,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:02,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:03,002 INFO L175 MemorySlicer]: Split 110 memory accesses to 11 slices as follows [2, 5, 8, 16, 12, 6, 6, 25, 8, 10, 12]. 23 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 16 writes are split as follows [0, 2, 1, 1, 1, 2, 1, 2, 1, 4, 1]. [2025-03-17 05:45:03,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:03,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:03,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:03,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:03,028 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:03,032 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:03,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 05:45:03,037 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 05:45:03,037 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 05:45:03,037 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 05:45:03,038 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (1/1) ... [2025-03-17 05:45:03,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 05:45:03,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 05:45:03,064 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:45:03,067 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:45:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 05:45:03,085 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-03-17 05:45:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-03-17 05:45:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-03-17 05:45:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-03-17 05:45:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-03-17 05:45:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-03-17 05:45:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-03-17 05:45:03,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-03-17 05:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-03-17 05:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-03-17 05:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-03-17 05:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-03-17 05:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-03-17 05:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-03-17 05:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-03-17 05:45:03,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-03-17 05:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-03-17 05:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-03-17 05:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-03-17 05:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-03-17 05:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-03-17 05:45:03,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-03-17 05:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-17 05:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-17 05:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-17 05:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-17 05:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-17 05:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-17 05:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-17 05:45:03,089 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-17 05:45:03,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-03-17 05:45:03,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 05:45:03,092 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 05:45:03,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-17 05:45:03,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-17 05:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-17 05:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-17 05:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-17 05:45:03,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-17 05:45:03,246 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 05:45:03,247 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 05:45:03,672 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L106: havoc property_#t~mem59#1;havoc property_#t~ite71#1;havoc property_#t~mem63#1;havoc property_#t~mem60#1;havoc property_#t~mem61#1;havoc property_#t~mem62#1;havoc property_#t~mem66#1;havoc property_#t~mem64#1;havoc property_#t~mem65#1;havoc property_#t~short67#1;havoc property_#t~ite70#1;havoc property_#t~mem69#1;havoc property_#t~mem68#1;havoc property_#t~mem72#1;havoc property_#t~mem73#1;havoc property_#t~ite80#1;havoc property_#t~mem76#1;havoc property_#t~mem74#1;havoc property_#t~mem75#1;havoc property_#t~mem79#1;havoc property_#t~mem77#1;havoc property_#t~mem78#1;havoc property_#t~short81#1;havoc property_#t~mem83#1;havoc property_#t~mem82#1;havoc property_#t~ite91#1;havoc property_#t~ite88#1;havoc property_#t~mem84#1;havoc property_#t~ite87#1;havoc property_#t~mem86#1;havoc property_#t~mem85#1;havoc property_#t~mem90#1;havoc property_#t~mem89#1;havoc property_#t~short92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~mem95#1;havoc property_#t~ite109#1;havoc property_#t~mem96#1;havoc property_#t~mem97#1;havoc property_#t~short98#1;havoc property_#t~ite106#1;havoc property_#t~mem99#1;havoc property_#t~ite103#1;havoc property_#t~mem100#1;havoc property_#t~mem102#1;havoc property_#t~mem101#1;havoc property_#t~mem105#1;havoc property_#t~mem104#1;havoc property_#t~mem108#1;havoc property_#t~mem107#1;havoc property_#t~short110#1; [2025-03-17 05:45:03,704 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-03-17 05:45:03,704 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 05:45:03,714 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 05:45:03,714 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 05:45:03,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:45:03 BoogieIcfgContainer [2025-03-17 05:45:03,714 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 05:45:03,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 05:45:03,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 05:45:03,719 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 05:45:03,720 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 05:45:02" (1/3) ... [2025-03-17 05:45:03,720 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9c5897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:45:03, skipping insertion in model container [2025-03-17 05:45:03,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 05:45:02" (2/3) ... [2025-03-17 05:45:03,721 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f9c5897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 05:45:03, skipping insertion in model container [2025-03-17 05:45:03,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 05:45:03" (3/3) ... [2025-03-17 05:45:03,722 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-31.i [2025-03-17 05:45:03,731 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 05:45:03,732 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-31.i that has 2 procedures, 81 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 05:45:03,770 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 05:45:03,780 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;@d8d7050, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 05:45:03,780 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 05:45:03,783 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:45:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:45:03,790 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:03,791 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:03,791 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:03,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:03,798 INFO L85 PathProgramCache]: Analyzing trace with hash -957346802, now seen corresponding path program 1 times [2025-03-17 05:45:03,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:03,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476484768] [2025-03-17 05:45:03,806 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:03,807 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:45:03,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:03,809 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:45:03,811 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:45:03,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:45:04,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:45:04,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:04,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:04,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 05:45:04,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-17 05:45:04,124 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:04,125 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:04,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476484768] [2025-03-17 05:45:04,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476484768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:04,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:04,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 05:45:04,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819226552] [2025-03-17 05:45:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:04,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 05:45:04,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:04,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 05:45:04,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 05:45:04,146 INFO L87 Difference]: Start difference. First operand has 81 states, 67 states have (on average 1.4776119402985075) internal successors, (99), 68 states have internal predecessors, (99), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:45:04,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:04,159 INFO L93 Difference]: Finished difference Result 156 states and 246 transitions. [2025-03-17 05:45:04,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 05:45:04,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 90 [2025-03-17 05:45:04,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:04,165 INFO L225 Difference]: With dead ends: 156 [2025-03-17 05:45:04,165 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 05:45:04,167 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 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:45:04,169 INFO L435 NwaCegarLoop]: 110 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, 110 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:45:04,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 05:45:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 05:45:04,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.3968253968253967) internal successors, (88), 63 states have internal predecessors, (88), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:45:04,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2025-03-17 05:45:04,192 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 90 [2025-03-17 05:45:04,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:04,192 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2025-03-17 05:45:04,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:45:04,192 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2025-03-17 05:45:04,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:45:04,194 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:04,194 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:04,203 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 (2)] Forceful destruction successful, exit code 0 [2025-03-17 05:45:04,395 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:45:04,395 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:04,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:04,396 INFO L85 PathProgramCache]: Analyzing trace with hash 522383813, now seen corresponding path program 1 times [2025-03-17 05:45:04,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:04,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443760927] [2025-03-17 05:45:04,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:04,397 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:45:04,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:04,400 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:45:04,402 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:45:04,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:45:04,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:45:04,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:04,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:04,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:45:04,657 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:04,696 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:45:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:04,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:04,731 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:04,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443760927] [2025-03-17 05:45:04,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443760927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:04,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:04,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:45:04,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924893632] [2025-03-17 05:45:04,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:04,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:45:04,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:04,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:45:04,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:45:04,733 INFO L87 Difference]: Start difference. First operand 76 states and 110 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:04,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:04,760 INFO L93 Difference]: Finished difference Result 151 states and 219 transitions. [2025-03-17 05:45:04,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:45:04,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2025-03-17 05:45:04,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:04,762 INFO L225 Difference]: With dead ends: 151 [2025-03-17 05:45:04,763 INFO L226 Difference]: Without dead ends: 76 [2025-03-17 05:45:04,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 88 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:45:04,765 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:04,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:04,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-17 05:45:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-17 05:45:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-17 05:45:04,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 109 transitions. [2025-03-17 05:45:04,781 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 109 transitions. Word has length 90 [2025-03-17 05:45:04,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:04,782 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 109 transitions. [2025-03-17 05:45:04,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:04,782 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 109 transitions. [2025-03-17 05:45:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-03-17 05:45:04,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:04,783 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:04,803 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:45:04,987 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:45:04,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:04,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash 1875693510, now seen corresponding path program 1 times [2025-03-17 05:45:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953043235] [2025-03-17 05:45:04,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:04,988 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:45:04,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:04,992 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:45:04,993 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:45:05,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 05:45:05,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 05:45:05,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:05,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:05,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:45:05,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:05,616 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 26 treesize of output 22 [2025-03-17 05:45:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:45:05,729 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:05,864 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:05,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953043235] [2025-03-17 05:45:05,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953043235] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:05,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:45:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-17 05:45:05,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477612907] [2025-03-17 05:45:05,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:05,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:05,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:05,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:05,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:45:05,866 INFO L87 Difference]: Start difference. First operand 76 states and 109 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:06,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:06,147 INFO L93 Difference]: Finished difference Result 192 states and 272 transitions. [2025-03-17 05:45:06,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:06,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 90 [2025-03-17 05:45:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:06,150 INFO L225 Difference]: With dead ends: 192 [2025-03-17 05:45:06,150 INFO L226 Difference]: Without dead ends: 117 [2025-03-17 05:45:06,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:45:06,151 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 52 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:06,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 405 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:06,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2025-03-17 05:45:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2025-03-17 05:45:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 99 states have internal predecessors, (135), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:45:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 161 transitions. [2025-03-17 05:45:06,171 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 161 transitions. Word has length 90 [2025-03-17 05:45:06,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:06,172 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 161 transitions. [2025-03-17 05:45:06,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 161 transitions. [2025-03-17 05:45:06,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:45:06,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:06,173 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:06,180 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:45:06,377 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:45:06,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:06,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:06,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1641052124, now seen corresponding path program 1 times [2025-03-17 05:45:06,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:06,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [542838802] [2025-03-17 05:45:06,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:06,378 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:45:06,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:06,380 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:45:06,381 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:45:06,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:45:06,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:45:06,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:06,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:06,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:45:06,604 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:06,618 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:45:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:06,636 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:06,636 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:06,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [542838802] [2025-03-17 05:45:06,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [542838802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:06,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:06,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 05:45:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459412856] [2025-03-17 05:45:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:06,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 05:45:06,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:06,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 05:45:06,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 05:45:06,638 INFO L87 Difference]: Start difference. First operand 114 states and 161 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:06,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:06,657 INFO L93 Difference]: Finished difference Result 227 states and 321 transitions. [2025-03-17 05:45:06,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 05:45:06,657 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2025-03-17 05:45:06,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:06,661 INFO L225 Difference]: With dead ends: 227 [2025-03-17 05:45:06,661 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:45:06,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 90 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:45:06,664 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:06,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 210 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:06,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:45:06,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-17 05:45:06,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 99 states have internal predecessors, (133), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:45:06,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2025-03-17 05:45:06,675 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 92 [2025-03-17 05:45:06,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:06,676 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2025-03-17 05:45:06,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:06,676 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2025-03-17 05:45:06,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:45:06,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:06,679 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:06,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-17 05:45:06,879 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:45:06,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:06,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1837565629, now seen corresponding path program 1 times [2025-03-17 05:45:06,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:06,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1996191835] [2025-03-17 05:45:06,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:06,881 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:45:06,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:06,885 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:45:06,885 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:45:06,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:45:07,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:45:07,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:07,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:07,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-17 05:45:07,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:07,108 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 24 treesize of output 20 [2025-03-17 05:45:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:07,175 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:07,175 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:07,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1996191835] [2025-03-17 05:45:07,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1996191835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:07,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:07,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:45:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028301373] [2025-03-17 05:45:07,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:07,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:45:07,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:07,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:45:07,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:45:07,176 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:07,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:07,503 INFO L93 Difference]: Finished difference Result 240 states and 333 transitions. [2025-03-17 05:45:07,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:45:07,511 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2025-03-17 05:45:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:07,512 INFO L225 Difference]: With dead ends: 240 [2025-03-17 05:45:07,512 INFO L226 Difference]: Without dead ends: 127 [2025-03-17 05:45:07,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:45:07,513 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 60 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:07,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 437 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:07,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-17 05:45:07,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 90. [2025-03-17 05:45:07,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:45:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 124 transitions. [2025-03-17 05:45:07,526 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 124 transitions. Word has length 92 [2025-03-17 05:45:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:07,527 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 124 transitions. [2025-03-17 05:45:07,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 124 transitions. [2025-03-17 05:45:07,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-17 05:45:07,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:07,531 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:07,539 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 (6)] Forceful destruction successful, exit code 0 [2025-03-17 05:45:07,731 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:45:07,731 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:07,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1744683049, now seen corresponding path program 1 times [2025-03-17 05:45:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090368434] [2025-03-17 05:45:07,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:07,732 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:45:07,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:07,735 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:45:07,735 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:45:07,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:45:07,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:45:07,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:07,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:07,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:45:07,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:08,125 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 19 [2025-03-17 05:45:08,146 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:45:08,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:08,205 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090368434] [2025-03-17 05:45:08,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090368434] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:08,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [542512121] [2025-03-17 05:45:08,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:08,205 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:08,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:45:08,209 INFO L229 MonitoredProcess]: Starting monitored process 8 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:45:08,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2025-03-17 05:45:08,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-17 05:45:08,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-17 05:45:08,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:08,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:08,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-17 05:45:08,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:08,574 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:08,575 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:08,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [542512121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:08,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:45:08,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-17 05:45:08,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953986896] [2025-03-17 05:45:08,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:08,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:08,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:08,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:08,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:45:08,577 INFO L87 Difference]: Start difference. First operand 90 states and 124 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:08,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:08,646 INFO L93 Difference]: Finished difference Result 206 states and 282 transitions. [2025-03-17 05:45:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:08,647 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 92 [2025-03-17 05:45:08,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:08,649 INFO L225 Difference]: With dead ends: 206 [2025-03-17 05:45:08,649 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 05:45:08,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:45:08,649 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 42 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:08,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 507 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:08,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 05:45:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 90. [2025-03-17 05:45:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 75 states have internal predecessors, (97), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:45:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 123 transitions. [2025-03-17 05:45:08,662 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 123 transitions. Word has length 92 [2025-03-17 05:45:08,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:08,663 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 123 transitions. [2025-03-17 05:45:08,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:08,663 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 123 transitions. [2025-03-17 05:45:08,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-17 05:45:08,665 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:08,665 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:08,672 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:45:08,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2025-03-17 05:45:09,065 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:09,066 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:09,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:09,066 INFO L85 PathProgramCache]: Analyzing trace with hash 441469495, now seen corresponding path program 1 times [2025-03-17 05:45:09,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:09,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078869993] [2025-03-17 05:45:09,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:09,066 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:45:09,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:09,068 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:45:09,069 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:45:09,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-17 05:45:09,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-17 05:45:09,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:09,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:09,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-17 05:45:09,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:09,487 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 15 [2025-03-17 05:45:09,508 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:45:09,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:09,592 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:09,593 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:09,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078869993] [2025-03-17 05:45:09,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078869993] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:09,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:45:09,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2025-03-17 05:45:09,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541090546] [2025-03-17 05:45:09,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:09,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:09,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:09,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:09,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:45:09,594 INFO L87 Difference]: Start difference. First operand 90 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:09,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:09,662 INFO L93 Difference]: Finished difference Result 199 states and 269 transitions. [2025-03-17 05:45:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:09,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 93 [2025-03-17 05:45:09,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:09,663 INFO L225 Difference]: With dead ends: 199 [2025-03-17 05:45:09,663 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 05:45:09,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2025-03-17 05:45:09,664 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 66 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:09,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 300 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:09,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 05:45:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 90. [2025-03-17 05:45:09,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.2972972972972974) internal successors, (96), 75 states have internal predecessors, (96), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-17 05:45:09,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2025-03-17 05:45:09,674 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 93 [2025-03-17 05:45:09,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:09,674 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2025-03-17 05:45:09,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:09,674 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2025-03-17 05:45:09,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-17 05:45:09,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:09,676 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:09,698 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:45:09,876 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:45:09,877 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:09,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:09,879 INFO L85 PathProgramCache]: Analyzing trace with hash 91801051, now seen corresponding path program 1 times [2025-03-17 05:45:09,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:09,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982630482] [2025-03-17 05:45:09,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:09,879 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:45:09,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:09,881 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:45:09,883 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:45:09,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 05:45:10,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 05:45:10,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:10,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:10,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:45:10,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:10,341 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:45:10,382 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:45:10,404 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:45:10,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:10,504 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:10,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982630482] [2025-03-17 05:45:10,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982630482] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:10,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:45:10,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2025-03-17 05:45:10,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219580595] [2025-03-17 05:45:10,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:10,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:45:10,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:10,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:45:10,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 05:45:10,505 INFO L87 Difference]: Start difference. First operand 90 states and 122 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:10,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:10,648 INFO L93 Difference]: Finished difference Result 250 states and 336 transitions. [2025-03-17 05:45:10,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:45:10,648 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 94 [2025-03-17 05:45:10,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:10,653 INFO L225 Difference]: With dead ends: 250 [2025-03-17 05:45:10,653 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 05:45:10,653 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:45:10,654 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 75 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 587 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:10,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 587 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 05:45:10,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2025-03-17 05:45:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 136 states have (on average 1.2941176470588236) internal successors, (176), 138 states have internal predecessors, (176), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:45:10,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 218 transitions. [2025-03-17 05:45:10,661 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 218 transitions. Word has length 94 [2025-03-17 05:45:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:10,663 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 218 transitions. [2025-03-17 05:45:10,663 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 218 transitions. [2025-03-17 05:45:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:45:10,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:10,664 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:10,672 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 (10)] Forceful destruction successful, exit code 0 [2025-03-17 05:45:10,865 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:45:10,865 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:10,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1306708080, now seen corresponding path program 1 times [2025-03-17 05:45:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2018742907] [2025-03-17 05:45:10,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:10,866 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:45:10,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:10,868 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:45:10,869 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:45:10,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:45:11,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:45:11,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:11,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:11,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-17 05:45:11,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:11,625 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:45:11,629 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:45:11,649 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:45:11,650 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:12,426 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:12,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2018742907] [2025-03-17 05:45:12,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2018742907] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:12,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:45:12,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2025-03-17 05:45:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875048553] [2025-03-17 05:45:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:12,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:45:12,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:12,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:45:12,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2025-03-17 05:45:12,427 INFO L87 Difference]: Start difference. First operand 162 states and 218 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:13,459 INFO L93 Difference]: Finished difference Result 321 states and 430 transitions. [2025-03-17 05:45:13,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:45:13,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2025-03-17 05:45:13,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:13,464 INFO L225 Difference]: With dead ends: 321 [2025-03-17 05:45:13,464 INFO L226 Difference]: Without dead ends: 164 [2025-03-17 05:45:13,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2025-03-17 05:45:13,465 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 90 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:13,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 377 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 05:45:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-03-17 05:45:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2025-03-17 05:45:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 136 states have (on average 1.286764705882353) internal successors, (175), 138 states have internal predecessors, (175), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:45:13,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 217 transitions. [2025-03-17 05:45:13,476 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 217 transitions. Word has length 95 [2025-03-17 05:45:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:13,477 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 217 transitions. [2025-03-17 05:45:13,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 217 transitions. [2025-03-17 05:45:13,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:45:13,478 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:13,478 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:13,485 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:45:13,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-17 05:45:13,678 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:13,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:13,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1634097908, now seen corresponding path program 1 times [2025-03-17 05:45:13,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:13,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39538414] [2025-03-17 05:45:13,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:13,680 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:45:13,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:13,682 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-17 05:45:13,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 (12)] Waiting until timeout for monitored process [2025-03-17 05:45:13,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:45:13,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:45:13,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:13,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:13,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:45:13,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:14,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 31 treesize of output 19 [2025-03-17 05:45:14,052 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:45:14,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:14,096 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39538414] [2025-03-17 05:45:14,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39538414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:14,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1039280489] [2025-03-17 05:45:14,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:14,096 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:14,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:45:14,098 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-17 05:45:14,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2025-03-17 05:45:14,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:45:14,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:45:14,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:14,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:14,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-17 05:45:14,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:14,722 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:45:14,914 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 11 [2025-03-17 05:45:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-17 05:45:14,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:15,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1039280489] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:15,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:45:15,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 7] total 17 [2025-03-17 05:45:15,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818927158] [2025-03-17 05:45:15,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:15,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:45:15,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:15,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:45:15,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:45:15,084 INFO L87 Difference]: Start difference. First operand 162 states and 217 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:15,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:15,241 INFO L93 Difference]: Finished difference Result 404 states and 534 transitions. [2025-03-17 05:45:15,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 05:45:15,242 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 95 [2025-03-17 05:45:15,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:15,243 INFO L225 Difference]: With dead ends: 404 [2025-03-17 05:45:15,243 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 05:45:15,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2025-03-17 05:45:15,244 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 44 mSDsluCounter, 488 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:15,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 629 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:15,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 05:45:15,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 172. [2025-03-17 05:45:15,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 148 states have internal predecessors, (189), 21 states have call successors, (21), 4 states have call predecessors, (21), 4 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:45:15,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 231 transitions. [2025-03-17 05:45:15,252 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 231 transitions. Word has length 95 [2025-03-17 05:45:15,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:15,252 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 231 transitions. [2025-03-17 05:45:15,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:15,253 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 231 transitions. [2025-03-17 05:45:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-17 05:45:15,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:15,253 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:15,264 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Ended with exit code 0 [2025-03-17 05:45:15,463 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 (12)] Ended with exit code 0 [2025-03-17 05:45:15,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /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:45:15,654 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:15,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:15,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1123563731, now seen corresponding path program 1 times [2025-03-17 05:45:15,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374065543] [2025-03-17 05:45:15,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:15,656 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:45:15,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:15,658 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:45:15,660 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:45:15,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:45:15,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:45:15,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:15,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:15,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-17 05:45:15,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:16,009 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 19 [2025-03-17 05:45:16,020 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:45:16,020 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:16,069 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:16,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [374065543] [2025-03-17 05:45:16,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [374065543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:16,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [305334928] [2025-03-17 05:45:16,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:16,069 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:16,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:45:16,071 INFO L229 MonitoredProcess]: Starting monitored process 15 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:45:16,072 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process [2025-03-17 05:45:16,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-17 05:45:16,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-17 05:45:16,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:16,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:16,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:45:16,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:16,818 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:45:17,249 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 19 [2025-03-17 05:45:17,255 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:45:17,255 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:17,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [305334928] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:17,395 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:45:17,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2025-03-17 05:45:17,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669338092] [2025-03-17 05:45:17,395 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:45:17,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-17 05:45:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:17,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-17 05:45:17,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2025-03-17 05:45:17,396 INFO L87 Difference]: Start difference. First operand 172 states and 231 transitions. Second operand has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-17 05:45:17,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:17,832 INFO L93 Difference]: Finished difference Result 337 states and 443 transitions. [2025-03-17 05:45:17,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:45:17,833 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 95 [2025-03-17 05:45:17,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:17,834 INFO L225 Difference]: With dead ends: 337 [2025-03-17 05:45:17,834 INFO L226 Difference]: Without dead ends: 170 [2025-03-17 05:45:17,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 223 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=583, Unknown=0, NotChecked=0, Total=756 [2025-03-17 05:45:17,835 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 207 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:17,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 603 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 05:45:17,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-17 05:45:17,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 162. [2025-03-17 05:45:17,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 134 states have (on average 1.2313432835820894) internal successors, (165), 136 states have internal predecessors, (165), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 19 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-17 05:45:17,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 207 transitions. [2025-03-17 05:45:17,852 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 207 transitions. Word has length 95 [2025-03-17 05:45:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:17,852 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 207 transitions. [2025-03-17 05:45:17,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.615384615384615) internal successors, (86), 13 states have internal predecessors, (86), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-17 05:45:17,852 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 207 transitions. [2025-03-17 05:45:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:45:17,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:17,853 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:17,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Ended with exit code 0 [2025-03-17 05:45:18,061 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:45:18,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:45:18,255 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:18,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:18,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1752727248, now seen corresponding path program 1 times [2025-03-17 05:45:18,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:18,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2080236604] [2025-03-17 05:45:18,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:18,256 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:45:18,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:18,258 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:45:18,260 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:45:18,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:45:18,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:45:18,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:18,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:18,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-17 05:45:18,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:19,534 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 18 treesize of output 19 [2025-03-17 05:45:19,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:45:19,961 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 191 treesize of output 121 [2025-03-17 05:45:19,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:45:19,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 138 [2025-03-17 05:45:20,072 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:45:20,072 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:20,460 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2080236604] [2025-03-17 05:45:20,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2080236604] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:20,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1943958437] [2025-03-17 05:45:20,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:20,460 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:20,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:45:20,462 INFO L229 MonitoredProcess]: Starting monitored process 17 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:45:20,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Waiting until timeout for monitored process [2025-03-17 05:45:20,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:45:21,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:45:21,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:21,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:21,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 05:45:21,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:22,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 05:45:22,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 05:45:23,544 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:45:23,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2025-03-17 05:45:23,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 274 treesize of output 146 [2025-03-17 05:45:23,573 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:45:23,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:23,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1943958437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:23,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:45:23,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2025-03-17 05:45:23,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002237683] [2025-03-17 05:45:23,695 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:45:23,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:45:23,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:23,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:45:23,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:45:23,697 INFO L87 Difference]: Start difference. First operand 162 states and 207 transitions. Second operand has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 17 states have internal predecessors, (89), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:45:27,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:45:28,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:28,770 INFO L93 Difference]: Finished difference Result 460 states and 577 transitions. [2025-03-17 05:45:28,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 05:45:28,771 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 17 states have internal predecessors, (89), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 96 [2025-03-17 05:45:28,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:28,773 INFO L225 Difference]: With dead ends: 460 [2025-03-17 05:45:28,773 INFO L226 Difference]: Without dead ends: 458 [2025-03-17 05:45:28,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2025-03-17 05:45:28,773 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 615 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 615 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:28,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [615 Valid, 1065 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 05:45:28,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-17 05:45:28,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 452. [2025-03-17 05:45:28,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 375 states have (on average 1.2106666666666666) internal successors, (454), 381 states have internal predecessors, (454), 58 states have call successors, (58), 18 states have call predecessors, (58), 18 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:45:28,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 570 transitions. [2025-03-17 05:45:28,813 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 570 transitions. Word has length 96 [2025-03-17 05:45:28,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:28,814 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 570 transitions. [2025-03-17 05:45:28,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.944444444444445) internal successors, (89), 17 states have internal predecessors, (89), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:45:28,814 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 570 transitions. [2025-03-17 05:45:28,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:45:28,815 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:28,815 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:28,823 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 (16)] Ended with exit code 0 [2025-03-17 05:45:29,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (17)] Ended with exit code 0 [2025-03-17 05:45:29,220 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,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:29,220 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:29,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:29,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1251555679, now seen corresponding path program 1 times [2025-03-17 05:45:29,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:29,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468511277] [2025-03-17 05:45:29,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:29,222 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:45:29,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:29,224 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:45:29,225 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:45:29,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:45:29,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:45:29,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:29,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:29,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:45:29,455 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:29,482 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:45:29,482 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:29,483 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:29,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468511277] [2025-03-17 05:45:29,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1468511277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:29,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:29,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:45:29,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389527647] [2025-03-17 05:45:29,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:29,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:45:29,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:29,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:45:29,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:45:29,483 INFO L87 Difference]: Start difference. First operand 452 states and 570 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:29,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:29,574 INFO L93 Difference]: Finished difference Result 899 states and 1133 transitions. [2025-03-17 05:45:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 05:45:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 96 [2025-03-17 05:45:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:29,579 INFO L225 Difference]: With dead ends: 899 [2025-03-17 05:45:29,584 INFO L226 Difference]: Without dead ends: 452 [2025-03-17 05:45:29,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:45:29,586 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:29,586 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 488 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 05:45:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2025-03-17 05:45:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 443. [2025-03-17 05:45:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 366 states have (on average 1.1994535519125684) internal successors, (439), 372 states have internal predecessors, (439), 58 states have call successors, (58), 18 states have call predecessors, (58), 18 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:45:29,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 555 transitions. [2025-03-17 05:45:29,741 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 555 transitions. Word has length 96 [2025-03-17 05:45:29,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:29,741 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 555 transitions. [2025-03-17 05:45:29,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:45:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 555 transitions. [2025-03-17 05:45:29,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 05:45:29,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:29,745 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:29,794 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:45:29,949 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:45:29,949 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:29,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1516748049, now seen corresponding path program 1 times [2025-03-17 05:45:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1071169453] [2025-03-17 05:45:29,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:29,950 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:45:29,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:29,953 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:45:29,954 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:45:30,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-17 05:45:30,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 05:45:30,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:30,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:30,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 05:45:30,193 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:45:30,207 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:30,208 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:30,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1071169453] [2025-03-17 05:45:30,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1071169453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:30,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:30,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 05:45:30,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011147649] [2025-03-17 05:45:30,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:30,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 05:45:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:30,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 05:45:30,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 05:45:30,209 INFO L87 Difference]: Start difference. First operand 443 states and 555 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:45:30,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:30,505 INFO L93 Difference]: Finished difference Result 881 states and 1103 transitions. [2025-03-17 05:45:30,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 05:45:30,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 96 [2025-03-17 05:45:30,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:30,508 INFO L225 Difference]: With dead ends: 881 [2025-03-17 05:45:30,508 INFO L226 Difference]: Without dead ends: 443 [2025-03-17 05:45:30,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 93 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:45:30,510 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:30,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 297 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 05:45:30,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2025-03-17 05:45:30,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2025-03-17 05:45:30,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 366 states have (on average 1.1967213114754098) internal successors, (438), 372 states have internal predecessors, (438), 58 states have call successors, (58), 18 states have call predecessors, (58), 18 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:45:30,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 554 transitions. [2025-03-17 05:45:30,561 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 554 transitions. Word has length 96 [2025-03-17 05:45:30,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:30,561 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 554 transitions. [2025-03-17 05:45:30,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:45:30,562 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 554 transitions. [2025-03-17 05:45:30,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 05:45:30,562 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:30,563 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:30,574 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:45:30,767 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:45:30,768 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:30,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:30,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1153714030, now seen corresponding path program 1 times [2025-03-17 05:45:30,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:30,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1891936693] [2025-03-17 05:45:30,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:30,769 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:45:30,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:30,774 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:45:30,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2025-03-17 05:45:30,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:45:31,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:45:31,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:31,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:31,103 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 05:45:31,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:31,934 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 18 treesize of output 19 [2025-03-17 05:45:32,313 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:45:32,314 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 191 treesize of output 121 [2025-03-17 05:45:32,319 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:45:32,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 136 [2025-03-17 05:45:32,397 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:45:32,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:32,716 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1891936693] [2025-03-17 05:45:32,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1891936693] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:32,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2009572233] [2025-03-17 05:45:32,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:32,716 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:32,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:45:32,718 INFO L229 MonitoredProcess]: Starting monitored process 21 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:45:32,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2025-03-17 05:45:32,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:45:33,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:45:33,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:33,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:33,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 05:45:33,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:34,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 05:45:41,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 05:45:41,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:45:41,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2025-03-17 05:45:41,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 272 treesize of output 144 [2025-03-17 05:45:41,846 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:45:41,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:42,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2009572233] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:42,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:45:42,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 24 [2025-03-17 05:45:42,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201876318] [2025-03-17 05:45:42,030 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:45:42,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 05:45:42,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:42,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 05:45:42,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=798, Unknown=1, NotChecked=0, Total=930 [2025-03-17 05:45:42,032 INFO L87 Difference]: Start difference. First operand 443 states and 554 transitions. Second operand has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 22 states have internal predecessors, (93), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:45:46,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result VALID. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 05:45:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:47,357 INFO L93 Difference]: Finished difference Result 754 states and 931 transitions. [2025-03-17 05:45:47,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 05:45:47,357 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 22 states have internal predecessors, (93), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 98 [2025-03-17 05:45:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:47,360 INFO L225 Difference]: With dead ends: 754 [2025-03-17 05:45:47,360 INFO L226 Difference]: Without dead ends: 752 [2025-03-17 05:45:47,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 217 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=430, Invalid=1921, Unknown=1, NotChecked=0, Total=2352 [2025-03-17 05:45:47,362 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 324 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 324 SdHoareTripleChecker+Valid, 1655 SdHoareTripleChecker+Invalid, 1071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:47,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [324 Valid, 1655 Invalid, 1071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-17 05:45:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2025-03-17 05:45:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 594. [2025-03-17 05:45:47,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 491 states have (on average 1.19959266802444) internal successors, (589), 499 states have internal predecessors, (589), 77 states have call successors, (77), 25 states have call predecessors, (77), 25 states have return successors, (77), 69 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-17 05:45:47,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 743 transitions. [2025-03-17 05:45:47,425 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 743 transitions. Word has length 98 [2025-03-17 05:45:47,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:47,425 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 743 transitions. [2025-03-17 05:45:47,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 4.043478260869565) internal successors, (93), 22 states have internal predecessors, (93), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:45:47,426 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 743 transitions. [2025-03-17 05:45:47,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-17 05:45:47,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:47,426 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:47,435 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 (20)] Forceful destruction successful, exit code 0 [2025-03-17 05:45:47,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2025-03-17 05:45:47,827 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,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:47,827 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:47,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash 957576339, now seen corresponding path program 1 times [2025-03-17 05:45:47,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:47,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2138455329] [2025-03-17 05:45:47,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:47,828 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:45:47,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:47,830 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:45:47,831 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:45:47,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 05:45:48,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 05:45:48,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:48,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:48,050 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 05:45:48,051 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:48,113 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-17 05:45:48,113 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 05:45:48,113 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:48,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2138455329] [2025-03-17 05:45:48,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2138455329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 05:45:48,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 05:45:48,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 05:45:48,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475452558] [2025-03-17 05:45:48,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:45:48,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 05:45:48,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:48,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 05:45:48,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-17 05:45:48,114 INFO L87 Difference]: Start difference. First operand 594 states and 743 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:45:48,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:48,257 INFO L93 Difference]: Finished difference Result 1066 states and 1323 transitions. [2025-03-17 05:45:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 05:45:48,258 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 98 [2025-03-17 05:45:48,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:48,261 INFO L225 Difference]: With dead ends: 1066 [2025-03-17 05:45:48,261 INFO L226 Difference]: Without dead ends: 471 [2025-03-17 05:45:48,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 93 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:45:48,263 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:48,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 418 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:45:48,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-03-17 05:45:48,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 447. [2025-03-17 05:45:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 369 states have (on average 1.1924119241192412) internal successors, (440), 375 states have internal predecessors, (440), 58 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:45:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 556 transitions. [2025-03-17 05:45:48,303 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 556 transitions. Word has length 98 [2025-03-17 05:45:48,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:48,304 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 556 transitions. [2025-03-17 05:45:48,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 2 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2025-03-17 05:45:48,304 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 556 transitions. [2025-03-17 05:45:48,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:45:48,305 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:48,305 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:48,313 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:45:48,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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:45:48,505 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:48,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:48,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2030956004, now seen corresponding path program 1 times [2025-03-17 05:45:48,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:48,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874965177] [2025-03-17 05:45:48,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:48,506 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:45:48,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:48,508 INFO L229 MonitoredProcess]: Starting monitored process 23 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:45:48,510 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 (23)] Waiting until timeout for monitored process [2025-03-17 05:45:48,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:45:48,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:45:48,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:48,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:48,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:45:48,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:49,016 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:45:49,018 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 15 [2025-03-17 05:45:49,043 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:45:49,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:49,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 34 treesize of output 26 [2025-03-17 05:45:49,344 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874965177] [2025-03-17 05:45:49,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874965177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:49,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2070710210] [2025-03-17 05:45:49,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:49,345 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:49,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:45:49,346 INFO L229 MonitoredProcess]: Starting monitored process 24 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:45:49,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2025-03-17 05:45:49,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:45:50,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:45:50,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:50,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:50,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:45:50,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:50,329 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:45:51,044 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:45:51,047 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 15 [2025-03-17 05:45:51,084 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:45:51,084 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:51,160 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:45:56,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2070710210] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:56,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:45:56,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-17 05:45:56,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249018010] [2025-03-17 05:45:56,323 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:45:56,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:45:56,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:45:56,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:45:56,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:45:56,326 INFO L87 Difference]: Start difference. First operand 447 states and 556 transitions. Second operand has 18 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-17 05:45:58,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:45:58,091 INFO L93 Difference]: Finished difference Result 1006 states and 1240 transitions. [2025-03-17 05:45:58,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:45:58,092 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 99 [2025-03-17 05:45:58,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:45:58,094 INFO L225 Difference]: With dead ends: 1006 [2025-03-17 05:45:58,094 INFO L226 Difference]: Without dead ends: 564 [2025-03-17 05:45:58,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 05:45:58,095 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 209 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-17 05:45:58,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 851 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-17 05:45:58,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2025-03-17 05:45:58,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 495. [2025-03-17 05:45:58,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 417 states have (on average 1.1774580335731415) internal successors, (491), 423 states have internal predecessors, (491), 58 states have call successors, (58), 19 states have call predecessors, (58), 19 states have return successors, (58), 52 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-17 05:45:58,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 607 transitions. [2025-03-17 05:45:58,135 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 607 transitions. Word has length 99 [2025-03-17 05:45:58,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:45:58,135 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 607 transitions. [2025-03-17 05:45:58,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.25) internal successors, (100), 16 states have internal predecessors, (100), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-17 05:45:58,136 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 607 transitions. [2025-03-17 05:45:58,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-17 05:45:58,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:45:58,137 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:45:58,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Ended with exit code 0 [2025-03-17 05:45:58,345 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 (23)] Forceful destruction successful, exit code 0 [2025-03-17 05:45:58,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,23 /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:45:58,537 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:45:58,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:45:58,538 INFO L85 PathProgramCache]: Analyzing trace with hash 473719283, now seen corresponding path program 1 times [2025-03-17 05:45:58,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:45:58,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1036363646] [2025-03-17 05:45:58,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:58,538 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:45:58,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:45:58,540 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:45:58,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 (25)] Waiting until timeout for monitored process [2025-03-17 05:45:58,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:45:58,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:45:58,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:45:58,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:45:58,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 05:45:58,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:45:59,123 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:45:59,126 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 28 treesize of output 16 [2025-03-17 05:45:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:45:59,174 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:45:59,508 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:45:59,690 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:45:59,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1036363646] [2025-03-17 05:45:59,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1036363646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:45:59,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1242223940] [2025-03-17 05:45:59,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:45:59,692 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:45:59,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:45:59,699 INFO L229 MonitoredProcess]: Starting monitored process 26 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:45:59,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2025-03-17 05:45:59,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-17 05:46:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-17 05:46:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:00,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:00,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-17 05:46:00,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:00,834 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:46:01,723 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:46:01,727 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 28 treesize of output 16 [2025-03-17 05:46:01,757 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-17 05:46:01,757 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:01,818 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:46:05,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1242223940] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:05,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:46:05,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2025-03-17 05:46:05,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393648769] [2025-03-17 05:46:05,331 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:46:05,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 05:46:05,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:05,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 05:46:05,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2025-03-17 05:46:05,332 INFO L87 Difference]: Start difference. First operand 495 states and 607 transitions. Second operand has 18 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-17 05:46:06,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:06,736 INFO L93 Difference]: Finished difference Result 1040 states and 1263 transitions. [2025-03-17 05:46:06,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-17 05:46:06,736 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) Word has length 99 [2025-03-17 05:46:06,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:06,738 INFO L225 Difference]: With dead ends: 1040 [2025-03-17 05:46:06,738 INFO L226 Difference]: Without dead ends: 550 [2025-03-17 05:46:06,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 233 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=280, Invalid=1052, Unknown=0, NotChecked=0, Total=1332 [2025-03-17 05:46:06,740 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 276 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:06,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 616 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-17 05:46:06,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-17 05:46:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 363. [2025-03-17 05:46:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 311 states have (on average 1.1832797427652733) internal successors, (368), 314 states have internal predecessors, (368), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:46:06,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 444 transitions. [2025-03-17 05:46:06,770 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 444 transitions. Word has length 99 [2025-03-17 05:46:06,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:06,770 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 444 transitions. [2025-03-17 05:46:06,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 16 states have internal predecessors, (97), 6 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 4 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-17 05:46:06,771 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 444 transitions. [2025-03-17 05:46:06,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-17 05:46:06,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:06,771 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:06,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2025-03-17 05:46:06,979 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:46:07,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:46:07,172 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:07,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:07,173 INFO L85 PathProgramCache]: Analyzing trace with hash -2085668267, now seen corresponding path program 1 times [2025-03-17 05:46:07,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:07,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256271631] [2025-03-17 05:46:07,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:07,173 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:46:07,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:07,176 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:46:07,177 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:46:07,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:07,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:07,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:07,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:07,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:46:07,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:08,709 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 18 treesize of output 19 [2025-03-17 05:46:09,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:09,400 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 191 treesize of output 121 [2025-03-17 05:46:09,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:09,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 258 treesize of output 138 [2025-03-17 05:46:09,660 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:46:09,660 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:10,260 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256271631] [2025-03-17 05:46:10,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256271631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:10,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [448139756] [2025-03-17 05:46:10,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:10,261 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:46:10,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:46:10,262 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:46:10,263 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:46:10,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-17 05:46:11,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-17 05:46:11,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:11,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:11,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 05:46:11,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:13,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2025-03-17 05:46:14,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2025-03-17 05:46:15,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:15,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 121 [2025-03-17 05:46:15,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 258 treesize of output 138 [2025-03-17 05:46:15,093 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:46:15,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:15,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [448139756] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:15,500 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 05:46:15,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2025-03-17 05:46:15,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251392908] [2025-03-17 05:46:15,500 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 05:46:15,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 05:46:15,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:15,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 05:46:15,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=526, Unknown=0, NotChecked=0, Total=600 [2025-03-17 05:46:15,501 INFO L87 Difference]: Start difference. First operand 363 states and 444 transitions. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:46:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:19,005 INFO L93 Difference]: Finished difference Result 565 states and 679 transitions. [2025-03-17 05:46:19,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 05:46:19,006 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) Word has length 101 [2025-03-17 05:46:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:19,008 INFO L225 Difference]: With dead ends: 565 [2025-03-17 05:46:19,008 INFO L226 Difference]: Without dead ends: 563 [2025-03-17 05:46:19,008 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 240 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2025-03-17 05:46:19,009 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 287 mSDsluCounter, 1084 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:19,009 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 1200 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-17 05:46:19,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2025-03-17 05:46:19,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 417. [2025-03-17 05:46:19,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 365 states have (on average 1.1863013698630136) internal successors, (433), 368 states have internal predecessors, (433), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-17 05:46:19,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 509 transitions. [2025-03-17 05:46:19,044 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 509 transitions. Word has length 101 [2025-03-17 05:46:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:19,045 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 509 transitions. [2025-03-17 05:46:19,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 4 states have call successors, (22), 4 states have call predecessors, (22), 4 states have return successors, (22), 4 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-17 05:46:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 509 transitions. [2025-03-17 05:46:19,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:46:19,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:19,046 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:19,055 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:46:19,258 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:46:19,447 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:46:19,449 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:19,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:19,450 INFO L85 PathProgramCache]: Analyzing trace with hash -2112324825, now seen corresponding path program 1 times [2025-03-17 05:46:19,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:19,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272969] [2025-03-17 05:46:19,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:19,450 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:46:19,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:19,457 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:46:19,458 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:46:19,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:46:19,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:46:19,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:19,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:19,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:46:19,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:20,238 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 5 proven. 135 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-17 05:46:20,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:20,402 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:20,402 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:20,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272969] [2025-03-17 05:46:20,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272969] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:20,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:20,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-17 05:46:20,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630717606] [2025-03-17 05:46:20,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:20,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:20,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:20,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:20,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:46:20,403 INFO L87 Difference]: Start difference. First operand 417 states and 509 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:20,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:20,582 INFO L93 Difference]: Finished difference Result 1021 states and 1236 transitions. [2025-03-17 05:46:20,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:20,583 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2025-03-17 05:46:20,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:20,586 INFO L225 Difference]: With dead ends: 1021 [2025-03-17 05:46:20,586 INFO L226 Difference]: Without dead ends: 605 [2025-03-17 05:46:20,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:46:20,589 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 44 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:20,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 464 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:20,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2025-03-17 05:46:20,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 599. [2025-03-17 05:46:20,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 531 states have (on average 1.177024482109228) internal successors, (625), 536 states have internal predecessors, (625), 46 states have call successors, (46), 21 states have call predecessors, (46), 21 states have return successors, (46), 41 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 05:46:20,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 717 transitions. [2025-03-17 05:46:20,676 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 717 transitions. Word has length 102 [2025-03-17 05:46:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:20,676 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 717 transitions. [2025-03-17 05:46:20,676 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 717 transitions. [2025-03-17 05:46:20,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-17 05:46:20,677 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:20,677 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:20,732 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 (29)] Forceful destruction successful, exit code 0 [2025-03-17 05:46:20,878 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:46:20,878 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:20,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:20,879 INFO L85 PathProgramCache]: Analyzing trace with hash -369514490, now seen corresponding path program 1 times [2025-03-17 05:46:20,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:20,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553097600] [2025-03-17 05:46:20,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:20,880 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:46:20,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:20,882 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:46:20,884 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:46:21,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-17 05:46:21,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-17 05:46:21,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:21,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:21,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-17 05:46:21,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:21,700 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-03-17 05:46:21,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:21,861 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 05:46:21,861 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:21,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553097600] [2025-03-17 05:46:21,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553097600] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:21,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 05:46:21,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2025-03-17 05:46:21,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955505] [2025-03-17 05:46:21,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 05:46:21,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 05:46:21,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-17 05:46:21,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 05:46:21,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2025-03-17 05:46:21,863 INFO L87 Difference]: Start difference. First operand 599 states and 717 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 05:46:22,029 INFO L93 Difference]: Finished difference Result 1319 states and 1578 transitions. [2025-03-17 05:46:22,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 05:46:22,039 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 102 [2025-03-17 05:46:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 05:46:22,041 INFO L225 Difference]: With dead ends: 1319 [2025-03-17 05:46:22,041 INFO L226 Difference]: Without dead ends: 721 [2025-03-17 05:46:22,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-17 05:46:22,053 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 59 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 05:46:22,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 334 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 05:46:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2025-03-17 05:46:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 637. [2025-03-17 05:46:22,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 569 states have (on average 1.163444639718805) internal successors, (662), 574 states have internal predecessors, (662), 46 states have call successors, (46), 21 states have call predecessors, (46), 21 states have return successors, (46), 41 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-17 05:46:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 754 transitions. [2025-03-17 05:46:22,377 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 754 transitions. Word has length 102 [2025-03-17 05:46:22,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 05:46:22,377 INFO L471 AbstractCegarLoop]: Abstraction has 637 states and 754 transitions. [2025-03-17 05:46:22,377 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, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2025-03-17 05:46:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 754 transitions. [2025-03-17 05:46:22,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-17 05:46:22,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 05:46:22,378 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 05:46:22,387 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:46:22,579 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:46:22,579 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 05:46:22,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 05:46:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash 34851283, now seen corresponding path program 1 times [2025-03-17 05:46:22,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-17 05:46:22,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990751333] [2025-03-17 05:46:22,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:22,580 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:46:22,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-17 05:46:22,582 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:46:22,583 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:46:22,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:46:22,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:46:22,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:22,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:22,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 05:46:22,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:24,235 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 18 treesize of output 19 [2025-03-17 05:46:24,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:24,725 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 191 treesize of output 121 [2025-03-17 05:46:24,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 05:46:24,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 136 [2025-03-17 05:46:24,926 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2025-03-17 05:46:24,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 05:46:25,574 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-17 05:46:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990751333] [2025-03-17 05:46:25,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1990751333] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 05:46:25,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1432491612] [2025-03-17 05:46:25,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 05:46:25,574 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-17 05:46:25,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-17 05:46:25,576 INFO L229 MonitoredProcess]: Starting monitored process 32 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:46:25,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2025-03-17 05:46:25,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-17 05:46:26,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-17 05:46:26,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 05:46:26,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 05:46:26,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 05:46:26,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 05:46:27,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17