./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-8.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 c4152c6ddb8daeef817ffef1c537ad37b3c36217e339560b7714fe0e7f9d968f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:33:01,328 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:33:01,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:33:01,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:33:01,394 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:33:01,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:33:01,417 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:33:01,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:33:01,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:33:01,418 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:33:01,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:33:01,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:33:01,419 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:33:01,419 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:33:01,419 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:33:01,419 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:33:01,419 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:33:01,419 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:33:01,419 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:33:01,420 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:01,420 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:33:01,420 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:33:01,421 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:33:01,421 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:33:01,421 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:33:01,421 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 -> c4152c6ddb8daeef817ffef1c537ad37b3c36217e339560b7714fe0e7f9d968f [2025-03-04 01:33:01,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:33:01,651 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:33:01,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:33:01,655 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:33:01,655 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:33:01,656 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-8.i [2025-03-04 01:33:02,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59aae72a0/962352210faa4346bebc5234f289895b/FLAG966fffdb8 [2025-03-04 01:33:03,095 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:33:03,097 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-8.i [2025-03-04 01:33:03,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59aae72a0/962352210faa4346bebc5234f289895b/FLAG966fffdb8 [2025-03-04 01:33:03,423 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59aae72a0/962352210faa4346bebc5234f289895b [2025-03-04 01:33:03,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:33:03,426 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:33:03,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:03,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:33:03,432 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:33:03,432 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@96a702a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03, skipping insertion in model container [2025-03-04 01:33:03,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,450 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:33:03,545 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-8.i[915,928] [2025-03-04 01:33:03,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:03,595 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:33:03,602 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-8.i[915,928] [2025-03-04 01:33:03,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:03,628 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:33:03,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03 WrapperNode [2025-03-04 01:33:03,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:03,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:03,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:33:03,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:33:03,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,675 INFO L138 Inliner]: procedures = 29, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-03-04 01:33:03,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:03,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:33:03,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:33:03,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:33:03,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,686 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,693 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,717 INFO L175 MemorySlicer]: Split 126 memory accesses to 16 slices as follows [2, 5, 6, 6, 6, 6, 11, 5, 8, 12, 10, 10, 3, 11, 19, 6]. 15 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-03-04 01:33:03,718 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,718 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,736 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,737 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,741 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,747 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:33:03,756 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:33:03,756 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:33:03,756 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:33:03,757 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (1/1) ... [2025-03-04 01:33:03,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:03,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:03,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:33:03,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:33:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:33:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:33:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:33:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:33:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:33:03,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-03-04 01:33:03,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#15 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-03-04 01:33:03,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-03-04 01:33:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-03-04 01:33:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-03-04 01:33:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-03-04 01:33:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#15 [2025-03-04 01:33:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:33:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:33:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:33:03,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#15 [2025-03-04 01:33:03,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:33:03,812 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-03-04 01:33:03,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:33:03,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:33:03,978 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:33:03,979 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:33:04,317 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~short86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite104#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite117#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:33:04,366 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:33:04,366 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:33:04,376 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:33:04,376 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:33:04,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:04 BoogieIcfgContainer [2025-03-04 01:33:04,377 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:33:04,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:33:04,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:33:04,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:33:04,381 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:33:03" (1/3) ... [2025-03-04 01:33:04,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154b2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:04, skipping insertion in model container [2025-03-04 01:33:04,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:03" (2/3) ... [2025-03-04 01:33:04,382 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@154b2b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:04, skipping insertion in model container [2025-03-04 01:33:04,382 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:04" (3/3) ... [2025-03-04 01:33:04,383 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-8.i [2025-03-04 01:33:04,392 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:33:04,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-8.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:33:04,433 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:33:04,440 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;@690db504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:33:04,440 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:33:04,443 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:04,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:04,450 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:04,451 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:04,451 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:04,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:04,456 INFO L85 PathProgramCache]: Analyzing trace with hash 774198712, now seen corresponding path program 1 times [2025-03-04 01:33:04,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:04,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736752545] [2025-03-04 01:33:04,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:04,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:04,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:04,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:04,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:04,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:33:04,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:04,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736752545] [2025-03-04 01:33:04,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736752545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:04,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423415181] [2025-03-04 01:33:04,741 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:04,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:04,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:04,744 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:33:04,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:33:04,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:04,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:04,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:04,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:04,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:33:05,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:05,016 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2025-03-04 01:33:05,018 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:05,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423415181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:05,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:05,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:33:05,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324676800] [2025-03-04 01:33:05,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:05,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:33:05,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:05,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:33:05,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:33:05,046 INFO L87 Difference]: Start difference. First operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:05,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:05,063 INFO L93 Difference]: Finished difference Result 192 states and 295 transitions. [2025-03-04 01:33:05,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:33:05,065 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-03-04 01:33:05,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:05,071 INFO L225 Difference]: With dead ends: 192 [2025-03-04 01:33:05,072 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 01:33:05,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:33:05,077 INFO L435 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:05,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:05,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 01:33:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 01:33:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-03-04 01:33:05,110 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2025-03-04 01:33:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:05,111 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-03-04 01:33:05,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-03-04 01:33:05,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:05,114 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:05,114 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:05,121 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-04 01:33:05,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:33:05,317 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:05,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:05,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1035623314, now seen corresponding path program 1 times [2025-03-04 01:33:05,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:05,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216247288] [2025-03-04 01:33:05,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:05,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:05,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:05,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:05,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:05,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:05,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:05,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216247288] [2025-03-04 01:33:05,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216247288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:05,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:05,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:05,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502093872] [2025-03-04 01:33:05,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:05,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:05,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:05,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:05,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:05,580 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:05,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:05,619 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2025-03-04 01:33:05,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:05,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-03-04 01:33:05,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:05,622 INFO L225 Difference]: With dead ends: 191 [2025-03-04 01:33:05,622 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:33:05,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:05,624 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:05,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:05,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:33:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:33:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-03-04 01:33:05,638 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2025-03-04 01:33:05,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:05,639 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-03-04 01:33:05,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:05,640 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-03-04 01:33:05,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:05,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:05,641 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:05,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:33:05,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:05,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:05,641 INFO L85 PathProgramCache]: Analyzing trace with hash -586926675, now seen corresponding path program 1 times [2025-03-04 01:33:05,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:05,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458389212] [2025-03-04 01:33:05,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:05,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:05,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:05,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:05,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:05,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:05,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:05,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458389212] [2025-03-04 01:33:05,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458389212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:05,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:05,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:05,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741570158] [2025-03-04 01:33:05,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:05,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:05,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:05,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:05,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:05,834 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:05,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:05,879 INFO L93 Difference]: Finished difference Result 196 states and 281 transitions. [2025-03-04 01:33:05,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:05,880 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:05,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:05,881 INFO L225 Difference]: With dead ends: 196 [2025-03-04 01:33:05,881 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 01:33:05,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:05,884 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:05,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 394 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:05,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 01:33:05,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 01:33:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 84 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:05,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 142 transitions. [2025-03-04 01:33:05,892 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 142 transitions. Word has length 123 [2025-03-04 01:33:05,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:05,894 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 142 transitions. [2025-03-04 01:33:05,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:05,894 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 142 transitions. [2025-03-04 01:33:05,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:05,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:05,896 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:05,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:33:05,896 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:05,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1900586158, now seen corresponding path program 1 times [2025-03-04 01:33:05,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:05,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467439385] [2025-03-04 01:33:05,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:05,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:05,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:05,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:05,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:05,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:06,029 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:06,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:06,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467439385] [2025-03-04 01:33:06,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467439385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:06,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:06,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:06,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859492221] [2025-03-04 01:33:06,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:06,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:06,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:06,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:06,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:06,033 INFO L87 Difference]: Start difference. First operand 100 states and 142 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:06,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:06,062 INFO L93 Difference]: Finished difference Result 200 states and 285 transitions. [2025-03-04 01:33:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:06,064 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:06,066 INFO L225 Difference]: With dead ends: 200 [2025-03-04 01:33:06,067 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 01:33:06,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:06,068 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:06,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 395 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:06,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 01:33:06,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2025-03-04 01:33:06,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 86 states have internal predecessors, (116), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:06,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 144 transitions. [2025-03-04 01:33:06,083 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 144 transitions. Word has length 123 [2025-03-04 01:33:06,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:06,083 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 144 transitions. [2025-03-04 01:33:06,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:06,083 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 144 transitions. [2025-03-04 01:33:06,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:06,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:06,087 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:06,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 01:33:06,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:06,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1506877457, now seen corresponding path program 1 times [2025-03-04 01:33:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:06,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328993875] [2025-03-04 01:33:06,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:06,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:06,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:06,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:06,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:06,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:06,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:06,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328993875] [2025-03-04 01:33:06,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328993875] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:06,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:06,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:06,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625117258] [2025-03-04 01:33:06,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:06,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:06,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:06,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:06,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:06,208 INFO L87 Difference]: Start difference. First operand 102 states and 144 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:06,235 INFO L93 Difference]: Finished difference Result 204 states and 289 transitions. [2025-03-04 01:33:06,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:06,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:06,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:06,237 INFO L225 Difference]: With dead ends: 204 [2025-03-04 01:33:06,237 INFO L226 Difference]: Without dead ends: 105 [2025-03-04 01:33:06,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:06,239 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 1 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:06,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:06,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2025-03-04 01:33:06,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2025-03-04 01:33:06,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3409090909090908) internal successors, (118), 88 states have internal predecessors, (118), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:06,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 146 transitions. [2025-03-04 01:33:06,252 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 146 transitions. Word has length 123 [2025-03-04 01:33:06,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:06,252 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 146 transitions. [2025-03-04 01:33:06,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:06,253 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 146 transitions. [2025-03-04 01:33:06,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:06,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:06,253 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:06,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 01:33:06,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:06,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:06,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1505953936, now seen corresponding path program 1 times [2025-03-04 01:33:06,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:06,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371236061] [2025-03-04 01:33:06,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:06,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:06,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:06,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:06,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:06,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:07,238 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:07,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:07,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371236061] [2025-03-04 01:33:07,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371236061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:07,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:07,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:33:07,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896143795] [2025-03-04 01:33:07,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:07,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:33:07,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:07,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:33:07,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:07,240 INFO L87 Difference]: Start difference. First operand 104 states and 146 transitions. Second operand has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:33:07,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:07,728 INFO L93 Difference]: Finished difference Result 262 states and 371 transitions. [2025-03-04 01:33:07,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:33:07,730 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-04 01:33:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:07,731 INFO L225 Difference]: With dead ends: 262 [2025-03-04 01:33:07,732 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 01:33:07,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:33:07,734 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 368 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:07,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 707 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:33:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 01:33:07,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 104. [2025-03-04 01:33:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 145 transitions. [2025-03-04 01:33:07,755 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 145 transitions. Word has length 123 [2025-03-04 01:33:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:07,756 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 145 transitions. [2025-03-04 01:33:07,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.0) internal successors, (56), 9 states have internal predecessors, (56), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:33:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 145 transitions. [2025-03-04 01:33:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:07,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:07,757 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:07,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:33:07,757 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:07,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1944541489, now seen corresponding path program 1 times [2025-03-04 01:33:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:07,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362540416] [2025-03-04 01:33:07,761 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:07,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:07,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:07,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:07,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:07,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:08,195 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:08,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:08,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362540416] [2025-03-04 01:33:08,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362540416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:08,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:08,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:08,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998768034] [2025-03-04 01:33:08,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:08,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:08,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:08,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:08,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:08,200 INFO L87 Difference]: Start difference. First operand 104 states and 145 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:08,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:08,265 INFO L93 Difference]: Finished difference Result 259 states and 358 transitions. [2025-03-04 01:33:08,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:08,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:08,269 INFO L225 Difference]: With dead ends: 259 [2025-03-04 01:33:08,270 INFO L226 Difference]: Without dead ends: 158 [2025-03-04 01:33:08,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:08,270 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 64 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 574 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:08,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 574 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-04 01:33:08,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 155. [2025-03-04 01:33:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 132 states have (on average 1.3106060606060606) internal successors, (173), 133 states have internal predecessors, (173), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:33:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 213 transitions. [2025-03-04 01:33:08,298 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 213 transitions. Word has length 123 [2025-03-04 01:33:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:08,298 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 213 transitions. [2025-03-04 01:33:08,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 213 transitions. [2025-03-04 01:33:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:33:08,299 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:08,299 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:08,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:33:08,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:08,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash 297176459, now seen corresponding path program 1 times [2025-03-04 01:33:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863977522] [2025-03-04 01:33:08,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:08,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:33:08,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:33:08,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:08,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:08,788 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863977522] [2025-03-04 01:33:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863977522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:08,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:33:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346320823] [2025-03-04 01:33:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:08,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:33:08,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:08,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:33:08,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:08,790 INFO L87 Difference]: Start difference. First operand 155 states and 213 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:09,308 INFO L93 Difference]: Finished difference Result 414 states and 572 transitions. [2025-03-04 01:33:09,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 01:33:09,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-03-04 01:33:09,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:09,312 INFO L225 Difference]: With dead ends: 414 [2025-03-04 01:33:09,312 INFO L226 Difference]: Without dead ends: 262 [2025-03-04 01:33:09,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:33:09,312 INFO L435 NwaCegarLoop]: 306 mSDtfsCounter, 305 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 1233 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:09,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 1233 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:33:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-04 01:33:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 197. [2025-03-04 01:33:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 165 states have (on average 1.3151515151515152) internal successors, (217), 166 states have internal predecessors, (217), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:09,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 273 transitions. [2025-03-04 01:33:09,351 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 273 transitions. Word has length 125 [2025-03-04 01:33:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:09,351 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 273 transitions. [2025-03-04 01:33:09,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:09,352 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 273 transitions. [2025-03-04 01:33:09,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:33:09,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:09,352 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:33:09,353 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash 113273035, now seen corresponding path program 1 times [2025-03-04 01:33:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:09,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013999824] [2025-03-04 01:33:09,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:09,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:33:09,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:33:09,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:09,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:09,985 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:09,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:09,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013999824] [2025-03-04 01:33:09,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013999824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:09,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:09,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:33:09,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628715137] [2025-03-04 01:33:09,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:09,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:33:09,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:09,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:33:09,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:33:09,987 INFO L87 Difference]: Start difference. First operand 197 states and 273 transitions. Second operand has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:33:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:10,356 INFO L93 Difference]: Finished difference Result 458 states and 636 transitions. [2025-03-04 01:33:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:33:10,357 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-03-04 01:33:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:10,359 INFO L225 Difference]: With dead ends: 458 [2025-03-04 01:33:10,359 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 01:33:10,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:33:10,360 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 195 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:10,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 1068 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:10,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 01:33:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 203. [2025-03-04 01:33:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 171 states have (on average 1.304093567251462) internal successors, (223), 172 states have internal predecessors, (223), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 279 transitions. [2025-03-04 01:33:10,387 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 279 transitions. Word has length 125 [2025-03-04 01:33:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:10,387 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 279 transitions. [2025-03-04 01:33:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.444444444444445) internal successors, (58), 10 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:33:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 279 transitions. [2025-03-04 01:33:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:33:10,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:10,390 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:10,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:33:10,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:10,391 INFO L85 PathProgramCache]: Analyzing trace with hash 943884075, now seen corresponding path program 1 times [2025-03-04 01:33:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701087862] [2025-03-04 01:33:10,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:10,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:33:10,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:33:10,425 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:10,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:11,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:11,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701087862] [2025-03-04 01:33:11,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701087862] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:11,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:11,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:33:11,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692169250] [2025-03-04 01:33:11,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:11,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:33:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:11,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:33:11,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:33:11,030 INFO L87 Difference]: Start difference. First operand 203 states and 279 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:33:11,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:11,841 INFO L93 Difference]: Finished difference Result 462 states and 634 transitions. [2025-03-04 01:33:11,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:33:11,842 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 125 [2025-03-04 01:33:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:11,844 INFO L225 Difference]: With dead ends: 462 [2025-03-04 01:33:11,845 INFO L226 Difference]: Without dead ends: 262 [2025-03-04 01:33:11,845 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:33:11,846 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 422 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:11,846 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1107 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:33:11,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2025-03-04 01:33:11,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 197. [2025-03-04 01:33:11,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 165 states have (on average 1.290909090909091) internal successors, (213), 166 states have internal predecessors, (213), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:11,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 269 transitions. [2025-03-04 01:33:11,875 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 269 transitions. Word has length 125 [2025-03-04 01:33:11,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:11,876 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 269 transitions. [2025-03-04 01:33:11,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:33:11,876 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 269 transitions. [2025-03-04 01:33:11,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:11,877 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:11,877 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:11,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:33:11,878 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:11,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:11,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1625944827, now seen corresponding path program 1 times [2025-03-04 01:33:11,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:11,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875763465] [2025-03-04 01:33:11,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:11,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:11,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:11,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:11,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:11,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:12,262 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:12,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:12,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875763465] [2025-03-04 01:33:12,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875763465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:12,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:12,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:33:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546596761] [2025-03-04 01:33:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:12,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:33:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:12,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:33:12,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:12,264 INFO L87 Difference]: Start difference. First operand 197 states and 269 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:12,405 INFO L93 Difference]: Finished difference Result 559 states and 768 transitions. [2025-03-04 01:33:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:33:12,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-03-04 01:33:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:12,408 INFO L225 Difference]: With dead ends: 559 [2025-03-04 01:33:12,408 INFO L226 Difference]: Without dead ends: 365 [2025-03-04 01:33:12,409 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:33:12,409 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 135 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:12,409 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 894 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-03-04 01:33:12,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 204. [2025-03-04 01:33:12,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 172 states have (on average 1.2848837209302326) internal successors, (221), 173 states have internal predecessors, (221), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:12,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 277 transitions. [2025-03-04 01:33:12,442 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 277 transitions. Word has length 127 [2025-03-04 01:33:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:12,442 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 277 transitions. [2025-03-04 01:33:12,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:12,442 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 277 transitions. [2025-03-04 01:33:12,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:12,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:12,444 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:12,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:33:12,444 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:12,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash -333630387, now seen corresponding path program 1 times [2025-03-04 01:33:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647350226] [2025-03-04 01:33:12,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:12,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:12,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:12,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:12,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:12,824 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:12,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:12,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647350226] [2025-03-04 01:33:12,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647350226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:12,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:12,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:33:12,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118038570] [2025-03-04 01:33:12,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:12,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:33:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:12,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:33:12,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:12,826 INFO L87 Difference]: Start difference. First operand 204 states and 277 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:12,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:12,963 INFO L93 Difference]: Finished difference Result 466 states and 637 transitions. [2025-03-04 01:33:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:33:12,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-03-04 01:33:12,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:12,966 INFO L225 Difference]: With dead ends: 466 [2025-03-04 01:33:12,966 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 01:33:12,966 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:33:12,967 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 122 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:12,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1079 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 01:33:13,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 198. [2025-03-04 01:33:13,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 166 states have (on average 1.2891566265060241) internal successors, (214), 167 states have internal predecessors, (214), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:13,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 270 transitions. [2025-03-04 01:33:13,004 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 270 transitions. Word has length 127 [2025-03-04 01:33:13,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:13,004 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 270 transitions. [2025-03-04 01:33:13,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 270 transitions. [2025-03-04 01:33:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:13,005 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:13,005 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:13,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:33:13,009 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:13,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:13,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1327592614, now seen corresponding path program 1 times [2025-03-04 01:33:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:13,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415509697] [2025-03-04 01:33:13,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:13,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:13,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:13,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:13,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:14,373 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:14,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:14,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415509697] [2025-03-04 01:33:14,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415509697] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:14,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:14,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:33:14,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747985100] [2025-03-04 01:33:14,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:14,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:33:14,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:14,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:33:14,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:33:14,376 INFO L87 Difference]: Start difference. First operand 198 states and 270 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:15,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:15,550 INFO L93 Difference]: Finished difference Result 460 states and 627 transitions. [2025-03-04 01:33:15,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 01:33:15,550 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-03-04 01:33:15,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:15,553 INFO L225 Difference]: With dead ends: 460 [2025-03-04 01:33:15,553 INFO L226 Difference]: Without dead ends: 265 [2025-03-04 01:33:15,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=403, Unknown=0, NotChecked=0, Total=506 [2025-03-04 01:33:15,554 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 728 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 266 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 266 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:15,554 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1260 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [266 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:33:15,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2025-03-04 01:33:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 198. [2025-03-04 01:33:15,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 166 states have (on average 1.2771084337349397) internal successors, (212), 167 states have internal predecessors, (212), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:33:15,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 268 transitions. [2025-03-04 01:33:15,586 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 268 transitions. Word has length 127 [2025-03-04 01:33:15,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:15,586 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 268 transitions. [2025-03-04 01:33:15,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 12 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:15,586 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 268 transitions. [2025-03-04 01:33:15,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:15,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:15,588 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:15,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:33:15,589 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:15,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1456675333, now seen corresponding path program 1 times [2025-03-04 01:33:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:15,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086623297] [2025-03-04 01:33:15,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:15,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:15,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:15,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:15,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:15,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:16,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:16,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086623297] [2025-03-04 01:33:16,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086623297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:16,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:16,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-04 01:33:16,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235525276] [2025-03-04 01:33:16,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:16,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 01:33:16,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:16,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 01:33:16,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:33:16,512 INFO L87 Difference]: Start difference. First operand 198 states and 268 transitions. Second operand has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:33:17,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:17,709 INFO L93 Difference]: Finished difference Result 268 states and 359 transitions. [2025-03-04 01:33:17,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:33:17,710 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2025-03-04 01:33:17,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:17,712 INFO L225 Difference]: With dead ends: 268 [2025-03-04 01:33:17,712 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 01:33:17,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:33:17,713 INFO L435 NwaCegarLoop]: 183 mSDtfsCounter, 718 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:17,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1302 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 01:33:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 01:33:17,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 263. [2025-03-04 01:33:17,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 216 states have (on average 1.2685185185185186) internal successors, (274), 218 states have internal predecessors, (274), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:33:17,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 354 transitions. [2025-03-04 01:33:17,757 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 354 transitions. Word has length 127 [2025-03-04 01:33:17,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:17,759 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 354 transitions. [2025-03-04 01:33:17,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.615384615384615) internal successors, (60), 14 states have internal predecessors, (60), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-04 01:33:17,760 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 354 transitions. [2025-03-04 01:33:17,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:17,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:17,761 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:17,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:33:17,761 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:17,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:17,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1457598854, now seen corresponding path program 1 times [2025-03-04 01:33:17,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:17,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587891724] [2025-03-04 01:33:17,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:17,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:17,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:17,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:17,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:17,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:18,014 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:18,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:33:18,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587891724] [2025-03-04 01:33:18,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587891724] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:18,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:18,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:18,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626005414] [2025-03-04 01:33:18,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:18,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:18,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:33:18,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:18,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:18,017 INFO L87 Difference]: Start difference. First operand 263 states and 354 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:18,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:18,174 INFO L93 Difference]: Finished difference Result 482 states and 642 transitions. [2025-03-04 01:33:18,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:18,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-03-04 01:33:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:18,176 INFO L225 Difference]: With dead ends: 482 [2025-03-04 01:33:18,176 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 01:33:18,178 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:33:18,178 INFO L435 NwaCegarLoop]: 197 mSDtfsCounter, 115 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:18,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 751 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:18,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 01:33:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 263. [2025-03-04 01:33:18,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 216 states have (on average 1.2592592592592593) internal successors, (272), 218 states have internal predecessors, (272), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 38 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-04 01:33:18,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 352 transitions. [2025-03-04 01:33:18,219 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 352 transitions. Word has length 127 [2025-03-04 01:33:18,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:18,219 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 352 transitions. [2025-03-04 01:33:18,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:18,219 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 352 transitions. [2025-03-04 01:33:18,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:18,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:18,220 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:18,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:33:18,220 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:18,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:18,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1949864761, now seen corresponding path program 1 times [2025-03-04 01:33:18,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:33:18,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136349079] [2025-03-04 01:33:18,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:18,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:33:18,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:18,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:18,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:18,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:33:18,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366968389] [2025-03-04 01:33:18,295 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:18,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:33:18,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:18,297 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-04 01:33:18,299 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-04 01:33:18,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:18,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:18,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:18,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:33:18,578 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:33:18,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:18,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:18,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:18,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:33:18,841 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:33:18,841 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:33:18,842 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:33:18,851 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-04 01:33:19,044 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,SelfDestructingSolverStorable15 [2025-03-04 01:33:19,046 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:19,165 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:33:19,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:33:19 BoogieIcfgContainer [2025-03-04 01:33:19,167 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:33:19,168 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:33:19,168 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:33:19,168 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:33:19,168 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:04" (3/4) ... [2025-03-04 01:33:19,170 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:33:19,170 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:33:19,171 INFO L158 Benchmark]: Toolchain (without parser) took 15745.03ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 112.4MB in the beginning and 354.0MB in the end (delta: -241.6MB). Peak memory consumption was 64.1MB. Max. memory is 16.1GB. [2025-03-04 01:33:19,171 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:33:19,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.96ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.4MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:33:19,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.38ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:33:19,171 INFO L158 Benchmark]: Boogie Preprocessor took 79.20ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 90.7MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:33:19,171 INFO L158 Benchmark]: IcfgBuilder took 621.17ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 52.6MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:33:19,172 INFO L158 Benchmark]: TraceAbstraction took 14788.88ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 52.1MB in the beginning and 354.1MB in the end (delta: -302.0MB). Peak memory consumption was 206.8MB. Max. memory is 16.1GB. [2025-03-04 01:33:19,172 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 444.6MB. Free memory was 354.1MB in the beginning and 354.0MB in the end (delta: 90.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:33:19,173 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.60ms. Allocated memory is still 201.3MB. Free memory is still 123.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.96ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.4MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.38ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.1MB in the end (delta: 3.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 79.20ms. Allocated memory is still 142.6MB. Free memory was 95.1MB in the beginning and 90.7MB in the end (delta: 4.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 621.17ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 52.6MB in the end (delta: 38.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14788.88ms. Allocated memory was 142.6MB in the beginning and 444.6MB in the end (delta: 302.0MB). Free memory was 52.1MB in the beginning and 354.1MB in the end (delta: -302.0MB). Peak memory consumption was 206.8MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 444.6MB. Free memory was 354.1MB in the beginning and 354.0MB in the end (delta: 90.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 97, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 95, overapproximation of someBinaryFLOATComparisonOperation at line 109, overapproximation of someBinaryFLOATComparisonOperation at line 99, overapproximation of someBinaryArithmeticFLOAToperation at line 73. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] unsigned char var_1_4 = 0; [L24] unsigned char var_1_4 = 0; [L25] unsigned char* var_1_4_Pointer = &(var_1_4); [L26] unsigned char var_1_5 = 0; [L26] unsigned char var_1_5 = 0; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [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] unsigned char var_1_7 = 0; [L30] unsigned char var_1_7 = 0; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] signed long int var_1_8 = 64; [L32] signed long int var_1_8 = 64; [L33] signed long int* var_1_8_Pointer = &(var_1_8); [L34] float var_1_12 = 2.4; [L34] float var_1_12 = 2.4; [L35] float* var_1_12_Pointer = &(var_1_12); [L36] float var_1_13 = 127.75; [L36] float var_1_13 = 127.75; [L37] float* var_1_13_Pointer = &(var_1_13); [L38] float var_1_14 = 0.0; [L38] float var_1_14 = 0.0; [L39] float* var_1_14_Pointer = &(var_1_14); [L40] float var_1_15 = 31.4; [L40] float var_1_15 = 31.4; [L41] float* var_1_15_Pointer = &(var_1_15); [L42] float var_1_16 = 256.75; [L42] float var_1_16 = 256.75; [L43] float* var_1_16_Pointer = &(var_1_16); [L44] float var_1_17 = 256.6; [L44] float var_1_17 = 256.6; [L45] float* var_1_17_Pointer = &(var_1_17); [L46] signed long int var_1_18 = 0; [L46] signed long int var_1_18 = 0; [L47] signed long int* var_1_18_Pointer = &(var_1_18); [L48] unsigned char var_1_19 = 32; [L48] unsigned char var_1_19 = 32; [L49] unsigned char* var_1_19_Pointer = &(var_1_19); [L50] unsigned char var_1_20 = 100; [L50] unsigned char var_1_20 = 100; [L51] unsigned char* var_1_20_Pointer = &(var_1_20); VAL [isInitial=0, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L113] isInitial = 1 [L114] FCALL initially() [L115] COND TRUE 1 [L116] FCALL updateLastVariables() [L117] CALL updateVariables() [L82] var_1_4 = __VERIFIER_nondet_uchar() [L83] EXPR \read(var_1_4) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L83] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L83] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L84] EXPR \read(var_1_4) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L84] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L84] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L85] var_1_5 = __VERIFIER_nondet_uchar() [L86] EXPR \read(var_1_5) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L86] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L86] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L87] EXPR \read(var_1_5) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L87] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L87] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L88] var_1_6 = __VERIFIER_nondet_uchar() [L89] EXPR \read(var_1_6) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L89] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L89] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L90] EXPR \read(var_1_6) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L90] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L90] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] EXPR \read(var_1_7) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L92] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L92] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L93] EXPR \read(var_1_7) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L94] var_1_13 = __VERIFIER_nondet_float() [L95] EXPR \read(var_1_13) [L95] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L95] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F [L95] EXPR \read(var_1_13) [L95] EXPR var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L95] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L95] EXPR (var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L95] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L95] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L96] var_1_14 = __VERIFIER_nondet_float() [L97] EXPR \read(var_1_14) [L97] EXPR var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L97] EXPR var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F [L97] EXPR \read(var_1_14) [L97] EXPR var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L97] EXPR (var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L97] EXPR (var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F ) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L97] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L97] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L98] var_1_15 = __VERIFIER_nondet_float() [L99] EXPR \read(var_1_15) [L99] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L99] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F [L99] EXPR \read(var_1_15) [L99] EXPR var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L99] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L99] EXPR (var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F ) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L99] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L99] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L100] var_1_16 = __VERIFIER_nondet_float() [L101] EXPR \read(var_1_16) [L101] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L101] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F [L101] EXPR \read(var_1_16) [L101] EXPR var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L101] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L101] EXPR (var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F ) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L101] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L101] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L102] var_1_20 = __VERIFIER_nondet_uchar() [L103] EXPR \read(var_1_20) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L103] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L103] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L104] EXPR \read(var_1_20) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L104] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L104] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L117] RET updateVariables() [L118] CALL step() [L55] EXPR \read(*var_1_14_Pointer) [L55] (*(var_1_17_Pointer)) = (*(var_1_14_Pointer)) [L56] EXPR \read(*var_1_20_Pointer) [L56] (*(var_1_19_Pointer)) = (*(var_1_20_Pointer)) [L57] EXPR \read(*var_1_19_Pointer) [L57] (*(var_1_18_Pointer)) = (*(var_1_19_Pointer)) [L58] EXPR \read(*var_1_19_Pointer) [L58] unsigned char stepLocal_1 = (*(var_1_19_Pointer)); [L59] EXPR \read(*var_1_18_Pointer) [L59] EXPR \read(*var_1_18_Pointer) [L59] EXPR \read(*var_1_19_Pointer) [L59] EXPR \read(*var_1_19_Pointer) [L59] signed long int stepLocal_0 = ((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer))); [L60] COND FALSE !(stepLocal_0 >= 1u) [L67] EXPR \read(*var_1_19_Pointer) [L67] (*(var_1_8_Pointer)) = (*(var_1_19_Pointer)) [L69] EXPR \read(*var_1_8_Pointer) [L69] signed long int stepLocal_2 = (*(var_1_8_Pointer)); [L70] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L70] COND FALSE !((*(var_1_19_Pointer)) > stepLocal_2) [L73] EXPR \read(*var_1_16_Pointer) [L73] EXPR \read(*var_1_14_Pointer) [L73] EXPR \read(*var_1_15_Pointer) [L73] (*(var_1_12_Pointer)) = ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))) [L75] EXPR \read(*var_1_18_Pointer) [L75] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L75] COND FALSE !((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) [L78] EXPR \read(*var_1_7_Pointer) [L78] (*(var_1_1_Pointer)) = (*(var_1_7_Pointer)) [L118] RET step() [L119] CALL, EXPR property() [L109] EXPR \read(*var_1_18_Pointer) [L109] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR ((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) [L109] EXPR \read(*var_1_1_Pointer) [L109] EXPR \read(*var_1_7_Pointer) [L109] EXPR ((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer)))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR (((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR (((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) [L109] EXPR \read(*var_1_18_Pointer) [L109] EXPR \read(*var_1_18_Pointer) [L109] EXPR \read(*var_1_19_Pointer) [L109] EXPR \read(*var_1_19_Pointer) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR ((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) [L109] EXPR \read(*var_1_8_Pointer) [L109] EXPR \read(*var_1_19_Pointer) [L109] EXPR ((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR (((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR ((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR ((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))))) [L109] EXPR \read(*var_1_19_Pointer) [L109] EXPR \read(*var_1_8_Pointer) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR ((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))) [L109] EXPR \read(*var_1_12_Pointer) [L109] EXPR \read(*var_1_16_Pointer) [L109] EXPR \read(*var_1_14_Pointer) [L109] EXPR \read(*var_1_15_Pointer) [L109] EXPR ((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR ((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer))))))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR (((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer)))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR (((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer)))) [L109] EXPR \read(*var_1_17_Pointer) [L109] EXPR \read(*var_1_14_Pointer) [L109] EXPR (((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer)))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR ((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR ((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR (((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned char) (*(var_1_20_Pointer)))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109] EXPR (((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned char) (*(var_1_20_Pointer)))) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L109-L110] return (((((((*(var_1_18_Pointer)) >= (8u * (*(var_1_8_Pointer)))) ? ((*(var_1_1_Pointer)) == ((unsigned char) (! ((*(var_1_4_Pointer)) || ((*(var_1_5_Pointer)) || (*(var_1_6_Pointer))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) (*(var_1_7_Pointer))))) && (((((*(var_1_18_Pointer)) * (*(var_1_18_Pointer))) * ((*(var_1_19_Pointer)) - (*(var_1_19_Pointer)))) >= 1u) ? (((*(var_1_18_Pointer)) <= (*(var_1_19_Pointer))) ? ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) : ((*(var_1_8_Pointer)) == ((signed long int) (*(var_1_19_Pointer)))))) && (((*(var_1_19_Pointer)) > (*(var_1_8_Pointer))) ? ((*(var_1_12_Pointer)) == ((float) ((*(var_1_13_Pointer)) + (((*(var_1_14_Pointer)) - (*(var_1_15_Pointer))) - (*(var_1_16_Pointer)))))) : ((*(var_1_12_Pointer)) == ((float) ((*(var_1_16_Pointer)) - ((*(var_1_14_Pointer)) + (*(var_1_15_Pointer)))))))) && ((*(var_1_17_Pointer)) == ((float) (*(var_1_14_Pointer))))) && ((*(var_1_18_Pointer)) == ((signed long int) (*(var_1_19_Pointer))))) && ((*(var_1_19_Pointer)) == ((unsigned char) (*(var_1_20_Pointer)))) ; [L119] RET, EXPR property() [L119] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] [L19] reach_error() VAL [isInitial=1, var_1_12={10:0}, var_1_12_Pointer={10:0}, var_1_13={11:0}, var_1_13_Pointer={11:0}, var_1_14={12:0}, var_1_14_Pointer={12:0}, var_1_15={13:0}, var_1_15_Pointer={13:0}, var_1_16={14:0}, var_1_16_Pointer={14:0}, var_1_17={15:0}, var_1_17_Pointer={15:0}, var_1_18={16:0}, var_1_18_Pointer={16:0}, var_1_19={17:0}, var_1_19_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_20={18:0}, var_1_20_Pointer={18:0}, var_1_4={5:0}, var_1_4_Pointer={5:0}, var_1_5={6:0}, var_1_5_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}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 99 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 16, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3175 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3175 mSDsluCounter, 11696 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9005 mSDsCounter, 743 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2640 IncrementalHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 743 mSolverCounterUnsat, 2691 mSDtfsCounter, 2640 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=263occurred in iteration=14, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 562 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.6s InterpolantComputationTime, 2248 NumberOfCodeBlocks, 2248 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1978 ConstructedInterpolants, 0 QuantifiedInterpolants, 6442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 593 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 5798/5824 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:33:19,199 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-8.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 c4152c6ddb8daeef817ffef1c537ad37b3c36217e339560b7714fe0e7f9d968f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:33:21,115 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:33:21,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:33:21,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:33:21,197 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:33:21,212 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:33:21,212 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:33:21,213 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:33:21,213 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:33:21,213 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:33:21,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:33:21,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:33:21,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:33:21,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:33:21,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:33:21,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:33:21,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:33:21,215 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:33:21,216 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:33:21,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:33:21,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:33:21,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:33:21,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:33:21,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:33:21,217 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:33:21,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:21,217 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:33:21,218 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:33:21,218 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:33:21,218 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:33:21,218 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:33:21,218 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:33:21,218 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:33:21,218 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:33:21,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:33:21,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:33:21,218 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 -> c4152c6ddb8daeef817ffef1c537ad37b3c36217e339560b7714fe0e7f9d968f [2025-03-04 01:33:21,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:33:21,434 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:33:21,436 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:33:21,436 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:33:21,437 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:33:21,437 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-8.i [2025-03-04 01:33:22,622 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c15ef941/0b00ecfde81948ce80f75dfdf2794947/FLAG4ecb571a9 [2025-03-04 01:33:22,813 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:33:22,814 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-8.i [2025-03-04 01:33:22,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c15ef941/0b00ecfde81948ce80f75dfdf2794947/FLAG4ecb571a9 [2025-03-04 01:33:22,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c15ef941/0b00ecfde81948ce80f75dfdf2794947 [2025-03-04 01:33:22,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:33:22,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:33:22,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:22,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:33:22,846 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:33:22,847 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:22" (1/1) ... [2025-03-04 01:33:22,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51c460e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:22, skipping insertion in model container [2025-03-04 01:33:22,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:33:22" (1/1) ... [2025-03-04 01:33:22,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:33:22,971 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-8.i[915,928] [2025-03-04 01:33:23,021 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:23,041 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:33:23,049 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-8.i[915,928] [2025-03-04 01:33:23,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:33:23,088 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:33:23,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23 WrapperNode [2025-03-04 01:33:23,089 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:33:23,090 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:23,090 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:33:23,090 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:33:23,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,133 INFO L138 Inliner]: procedures = 33, calls = 166, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 481 [2025-03-04 01:33:23,133 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:33:23,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:33:23,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:33:23,134 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:33:23,140 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,145 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,167 INFO L175 MemorySlicer]: Split 126 memory accesses to 16 slices as follows [2, 5, 6, 6, 6, 6, 11, 5, 8, 12, 10, 10, 3, 11, 19, 6]. 15 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 19 writes are split as follows [0, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2025-03-04 01:33:23,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,189 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:33:23,202 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:33:23,202 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:33:23,202 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:33:23,203 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (1/1) ... [2025-03-04 01:33:23,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:33:23,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:33:23,228 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:33:23,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:33:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:33:23,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:33:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:33:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:33:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:33:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:33:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:33:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-03-04 01:33:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-03-04 01:33:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-03-04 01:33:23,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-03-04 01:33:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-03-04 01:33:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-03-04 01:33:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-03-04 01:33:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-03-04 01:33:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-03-04 01:33:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#15 [2025-03-04 01:33:23,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:33:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:33:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:33:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:33:23,248 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:33:23,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:33:23,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-03-04 01:33:23,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-03-04 01:33:23,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-03-04 01:33:23,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-03-04 01:33:23,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-03-04 01:33:23,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-03-04 01:33:23,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-03-04 01:33:23,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-03-04 01:33:23,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-03-04 01:33:23,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#15 [2025-03-04 01:33:23,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:33:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:33:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:33:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:33:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:33:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:33:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2025-03-04 01:33:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2025-03-04 01:33:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2025-03-04 01:33:23,251 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2025-03-04 01:33:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2025-03-04 01:33:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2025-03-04 01:33:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2025-03-04 01:33:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2025-03-04 01:33:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#14 [2025-03-04 01:33:23,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#15 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#7 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#8 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#9 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#10 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#11 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#12 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#13 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#14 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#15 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#14 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#15 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:33:23,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#7 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#8 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#9 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#10 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#11 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#12 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#13 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#14 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#15 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#7 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#8 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#9 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#10 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#11 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#12 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#13 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#14 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#15 [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:33:23,254 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:33:23,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:33:23,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:33:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:33:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:33:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:33:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:33:23,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#15 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2025-03-04 01:33:23,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#7 [2025-03-04 01:33:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#8 [2025-03-04 01:33:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#9 [2025-03-04 01:33:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#10 [2025-03-04 01:33:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#11 [2025-03-04 01:33:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#12 [2025-03-04 01:33:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#13 [2025-03-04 01:33:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#14 [2025-03-04 01:33:23,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#15 [2025-03-04 01:33:23,429 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:33:23,430 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:33:25,750 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L109: havoc property_#t~mem81#1;havoc property_#t~mem80#1;havoc property_#t~ite90#1;havoc property_#t~mem87#1;havoc property_#t~mem85#1;havoc property_#t~mem82#1;havoc property_#t~mem83#1;havoc property_#t~short84#1;havoc property_#t~short86#1;havoc property_#t~mem89#1;havoc property_#t~mem88#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite104#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite101#1;havoc property_#t~mem98#1;havoc property_#t~mem97#1;havoc property_#t~mem100#1;havoc property_#t~mem99#1;havoc property_#t~mem103#1;havoc property_#t~mem102#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~mem107#1;havoc property_#t~ite117#1;havoc property_#t~mem112#1;havoc property_#t~mem111#1;havoc property_#t~mem108#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem116#1;havoc property_#t~mem115#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~short118#1;havoc property_#t~mem120#1;havoc property_#t~mem119#1;havoc property_#t~short121#1;havoc property_#t~mem123#1;havoc property_#t~mem122#1;havoc property_#t~short124#1;havoc property_#t~mem126#1;havoc property_#t~mem125#1;havoc property_#t~short127#1; [2025-03-04 01:33:25,786 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2025-03-04 01:33:25,787 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:33:25,796 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:33:25,797 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:33:25,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:25 BoogieIcfgContainer [2025-03-04 01:33:25,797 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:33:25,799 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:33:25,799 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:33:25,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:33:25,802 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:33:22" (1/3) ... [2025-03-04 01:33:25,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f84e0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:25, skipping insertion in model container [2025-03-04 01:33:25,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:33:23" (2/3) ... [2025-03-04 01:33:25,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f84e0bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:33:25, skipping insertion in model container [2025-03-04 01:33:25,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:33:25" (3/3) ... [2025-03-04 01:33:25,804 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-8.i [2025-03-04 01:33:25,814 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:33:25,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-8.i that has 2 procedures, 99 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:33:25,886 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:33:25,897 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;@1c7d728b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:33:25,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:33:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:25,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:25,908 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:25,908 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:25,908 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:25,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash 774198712, now seen corresponding path program 1 times [2025-03-04 01:33:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:25,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114230863] [2025-03-04 01:33:25,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:25,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:25,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:25,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:25,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:33:26,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:26,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:26,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:26,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:26,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:33:26,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:26,425 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2025-03-04 01:33:26,426 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:26,426 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:26,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114230863] [2025-03-04 01:33:26,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114230863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:26,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:26,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:33:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847407529] [2025-03-04 01:33:26,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:26,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:33:26,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:26,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:33:26,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:33:26,449 INFO L87 Difference]: Start difference. First operand has 99 states, 82 states have (on average 1.4024390243902438) internal successors, (115), 83 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:26,470 INFO L93 Difference]: Finished difference Result 192 states and 295 transitions. [2025-03-04 01:33:26,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:33:26,472 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-03-04 01:33:26,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:26,478 INFO L225 Difference]: With dead ends: 192 [2025-03-04 01:33:26,478 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 01:33:26,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:33:26,483 INFO L435 NwaCegarLoop]: 138 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, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:26,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:26,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 01:33:26,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-03-04 01:33:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.375) internal successors, (110), 80 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:26,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 138 transitions. [2025-03-04 01:33:26,519 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 138 transitions. Word has length 123 [2025-03-04 01:33:26,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:26,520 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 138 transitions. [2025-03-04 01:33:26,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 138 transitions. [2025-03-04 01:33:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:26,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:26,523 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:26,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:33:26,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:26,727 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:26,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:26,728 INFO L85 PathProgramCache]: Analyzing trace with hash -1035623314, now seen corresponding path program 1 times [2025-03-04 01:33:26,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:26,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1885264359] [2025-03-04 01:33:26,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:26,728 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:26,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:26,730 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:26,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:33:26,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:27,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:27,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:27,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:27,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:33:27,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:27,209 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-04 01:33:27,210 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:27,210 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:27,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1885264359] [2025-03-04 01:33:27,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1885264359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:27,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:27,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:27,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139889594] [2025-03-04 01:33:27,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:27,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:27,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:27,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:27,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:27,213 INFO L87 Difference]: Start difference. First operand 96 states and 138 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:27,269 INFO L93 Difference]: Finished difference Result 191 states and 276 transitions. [2025-03-04 01:33:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:27,272 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2025-03-04 01:33:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:27,273 INFO L225 Difference]: With dead ends: 191 [2025-03-04 01:33:27,274 INFO L226 Difference]: Without dead ends: 98 [2025-03-04 01:33:27,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:27,275 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 397 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.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:27,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 397 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:33:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-04 01:33:27,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-03-04 01:33:27,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.3658536585365855) internal successors, (112), 82 states have internal predecessors, (112), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:27,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 140 transitions. [2025-03-04 01:33:27,285 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 140 transitions. Word has length 123 [2025-03-04 01:33:27,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:27,286 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 140 transitions. [2025-03-04 01:33:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:27,288 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 140 transitions. [2025-03-04 01:33:27,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-04 01:33:27,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:27,292 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:27,307 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-04 01:33:27,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:27,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:27,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash -586926675, now seen corresponding path program 1 times [2025-03-04 01:33:27,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:27,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403252190] [2025-03-04 01:33:27,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:27,494 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:27,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:27,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:27,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:33:27,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-04 01:33:27,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-04 01:33:27,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:27,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:27,943 INFO L256 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 01:33:27,950 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:28,676 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-04 01:33:28,738 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-04 01:33:28,745 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 63 treesize of output 39 [2025-03-04 01:33:28,805 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 24 proven. 214 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-04 01:33:28,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:28,945 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:28,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:28,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403252190] [2025-03-04 01:33:28,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403252190] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:28,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:28,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2025-03-04 01:33:28,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734849523] [2025-03-04 01:33:28,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:28,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:28,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:28,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:28,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:33:28,946 INFO L87 Difference]: Start difference. First operand 98 states and 140 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:29,071 INFO L93 Difference]: Finished difference Result 241 states and 342 transitions. [2025-03-04 01:33:29,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:33:29,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 123 [2025-03-04 01:33:29,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:29,074 INFO L225 Difference]: With dead ends: 241 [2025-03-04 01:33:29,074 INFO L226 Difference]: Without dead ends: 146 [2025-03-04 01:33:29,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2025-03-04 01:33:29,075 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 64 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 578 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-04 01:33:29,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 578 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-04 01:33:29,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2025-03-04 01:33:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.35) internal successors, (162), 121 states have internal predecessors, (162), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:33:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 202 transitions. [2025-03-04 01:33:29,084 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 202 transitions. Word has length 123 [2025-03-04 01:33:29,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:29,084 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 202 transitions. [2025-03-04 01:33:29,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 202 transitions. [2025-03-04 01:33:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:33:29,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:29,086 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:29,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2025-03-04 01:33:29,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:29,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:29,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:29,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1004852807, now seen corresponding path program 1 times [2025-03-04 01:33:29,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:29,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289948602] [2025-03-04 01:33:29,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:29,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:29,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:29,291 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:29,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2025-03-04 01:33:29,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:33:29,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:33:29,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:29,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:29,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:33:29,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:29,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-04 01:33:29,963 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:33:29,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:30,207 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:33:30,207 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 20 treesize of output 19 [2025-03-04 01:33:30,236 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:33:30,237 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:30,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289948602] [2025-03-04 01:33:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289948602] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:33:30,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:33:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-04 01:33:30,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813014858] [2025-03-04 01:33:30,237 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:33:30,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:33:30,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:30,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:33:30,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:33:30,238 INFO L87 Difference]: Start difference. First operand 143 states and 202 transitions. Second operand has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:33:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:30,623 INFO L93 Difference]: Finished difference Result 299 states and 415 transitions. [2025-03-04 01:33:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:33:30,625 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 125 [2025-03-04 01:33:30,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:30,627 INFO L225 Difference]: With dead ends: 299 [2025-03-04 01:33:30,627 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 01:33:30,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:33:30,628 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 248 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:30,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 536 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:30,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 01:33:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 151. [2025-03-04 01:33:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.3253968253968254) internal successors, (167), 127 states have internal predecessors, (167), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2025-03-04 01:33:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 207 transitions. [2025-03-04 01:33:30,647 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 207 transitions. Word has length 125 [2025-03-04 01:33:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:30,650 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 207 transitions. [2025-03-04 01:33:30,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:33:30,650 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 207 transitions. [2025-03-04 01:33:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:33:30,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:30,651 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:30,665 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2025-03-04 01:33:30,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:30,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:30,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:30,852 INFO L85 PathProgramCache]: Analyzing trace with hash 820949383, now seen corresponding path program 1 times [2025-03-04 01:33:30,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:30,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744462753] [2025-03-04 01:33:30,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:30,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:30,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:30,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:30,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2025-03-04 01:33:30,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:33:31,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:33:31,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:31,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:31,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:33:31,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:31,351 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-04 01:33:31,404 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:31,404 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:31,404 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:31,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744462753] [2025-03-04 01:33:31,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744462753] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:31,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:31,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:33:31,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207249231] [2025-03-04 01:33:31,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:31,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:31,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:31,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:31,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:31,405 INFO L87 Difference]: Start difference. First operand 151 states and 207 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:31,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:31,653 INFO L93 Difference]: Finished difference Result 370 states and 507 transitions. [2025-03-04 01:33:31,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:31,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 125 [2025-03-04 01:33:31,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:31,656 INFO L225 Difference]: With dead ends: 370 [2025-03-04 01:33:31,656 INFO L226 Difference]: Without dead ends: 222 [2025-03-04 01:33:31,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 120 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-04 01:33:31,657 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 124 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:31,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 882 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:31,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-04 01:33:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2025-03-04 01:33:31,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 178 states have (on average 1.297752808988764) internal successors, (231), 180 states have internal predecessors, (231), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:33:31,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 299 transitions. [2025-03-04 01:33:31,678 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 299 transitions. Word has length 125 [2025-03-04 01:33:31,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:31,678 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 299 transitions. [2025-03-04 01:33:31,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:31,678 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 299 transitions. [2025-03-04 01:33:31,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 01:33:31,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:31,679 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:31,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2025-03-04 01:33:31,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:31,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:31,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:31,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1651560423, now seen corresponding path program 1 times [2025-03-04 01:33:31,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:31,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493180429] [2025-03-04 01:33:31,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:31,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-04 01:33:31,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:31,882 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:31,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 (7)] Waiting until timeout for monitored process [2025-03-04 01:33:32,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 01:33:32,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 01:33:32,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:32,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:32,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:33:32,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:32,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-04 01:33:32,525 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 12 proven. 88 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 01:33:32,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:32,729 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:33:32,730 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 20 treesize of output 19 [2025-03-04 01:33:32,758 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:33:32,758 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493180429] [2025-03-04 01:33:32,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493180429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:33:32,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:33:32,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-04 01:33:32,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438085309] [2025-03-04 01:33:32,759 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:33:32,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:33:32,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:32,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:33:32,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:33:32,760 INFO L87 Difference]: Start difference. First operand 220 states and 299 transitions. Second operand has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:33:33,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:33,110 INFO L93 Difference]: Finished difference Result 388 states and 523 transitions. [2025-03-04 01:33:33,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:33:33,111 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 125 [2025-03-04 01:33:33,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:33,112 INFO L225 Difference]: With dead ends: 388 [2025-03-04 01:33:33,112 INFO L226 Difference]: Without dead ends: 234 [2025-03-04 01:33:33,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 239 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:33:33,113 INFO L435 NwaCegarLoop]: 116 mSDtfsCounter, 171 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:33,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 530 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:33,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-04 01:33:33,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 220. [2025-03-04 01:33:33,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 178 states have (on average 1.2865168539325842) internal successors, (229), 180 states have internal predecessors, (229), 34 states have call successors, (34), 7 states have call predecessors, (34), 7 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 01:33:33,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 297 transitions. [2025-03-04 01:33:33,130 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 297 transitions. Word has length 125 [2025-03-04 01:33:33,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:33,131 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 297 transitions. [2025-03-04 01:33:33,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.888888888888889) internal successors, (71), 11 states have internal predecessors, (71), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:33:33,131 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 297 transitions. [2025-03-04 01:33:33,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:33,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:33,132 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:33,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2025-03-04 01:33:33,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:33,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:33,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:33,333 INFO L85 PathProgramCache]: Analyzing trace with hash -734691639, now seen corresponding path program 1 times [2025-03-04 01:33:33,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:33,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636970605] [2025-03-04 01:33:33,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:33,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:33,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:33,335 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:33,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2025-03-04 01:33:33,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:33,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:33,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:33,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:33,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 01:33:33,761 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:34,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-04 01:33:34,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2025-03-04 01:33:34,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2025-03-04 01:33:34,980 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 53 treesize of output 37 [2025-03-04 01:33:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 254 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-04 01:33:35,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:36,197 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:33:36,197 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 65 treesize of output 60 [2025-03-04 01:33:36,444 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 01:33:36,445 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 27 treesize of output 30 [2025-03-04 01:33:36,572 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 48 proven. 60 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2025-03-04 01:33:36,572 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:36,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636970605] [2025-03-04 01:33:36,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636970605] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:33:36,572 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:33:36,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 37 [2025-03-04 01:33:36,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091923850] [2025-03-04 01:33:36,573 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:33:36,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 01:33:36,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:36,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 01:33:36,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1167, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 01:33:36,574 INFO L87 Difference]: Start difference. First operand 220 states and 297 transitions. Second operand has 37 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 states have internal predecessors, (119), 9 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-04 01:33:39,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:39,311 INFO L93 Difference]: Finished difference Result 489 states and 627 transitions. [2025-03-04 01:33:39,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 01:33:39,312 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 states have internal predecessors, (119), 9 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) Word has length 127 [2025-03-04 01:33:39,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:39,313 INFO L225 Difference]: With dead ends: 489 [2025-03-04 01:33:39,313 INFO L226 Difference]: Without dead ends: 335 [2025-03-04 01:33:39,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1026, Invalid=5294, Unknown=0, NotChecked=0, Total=6320 [2025-03-04 01:33:39,315 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 660 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 1185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:39,316 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1977 Invalid, 1185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 01:33:39,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-04 01:33:39,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 242. [2025-03-04 01:33:39,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 196 states have (on average 1.260204081632653) internal successors, (247), 198 states have internal predecessors, (247), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 30 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 01:33:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 311 transitions. [2025-03-04 01:33:39,334 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 311 transitions. Word has length 127 [2025-03-04 01:33:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:39,334 INFO L471 AbstractCegarLoop]: Abstraction has 242 states and 311 transitions. [2025-03-04 01:33:39,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 31 states have (on average 3.838709677419355) internal successors, (119), 32 states have internal predecessors, (119), 9 states have call successors, (28), 6 states have call predecessors, (28), 9 states have return successors, (28), 6 states have call predecessors, (28), 9 states have call successors, (28) [2025-03-04 01:33:39,335 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 311 transitions. [2025-03-04 01:33:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:39,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:39,335 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:39,349 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 (8)] Forceful destruction successful, exit code 0 [2025-03-04 01:33:39,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:39,536 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:39,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:39,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1579163510, now seen corresponding path program 1 times [2025-03-04 01:33:39,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:39,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1675709658] [2025-03-04 01:33:39,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:39,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:39,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:39,539 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:39,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2025-03-04 01:33:39,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:39,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:39,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:39,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:39,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:33:39,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:40,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2025-03-04 01:33:40,116 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 10 proven. 162 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2025-03-04 01:33:40,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:40,270 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2025-03-04 01:33:40,270 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 20 treesize of output 19 [2025-03-04 01:33:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:33:40,311 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:40,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1675709658] [2025-03-04 01:33:40,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1675709658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:33:40,311 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:33:40,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2025-03-04 01:33:40,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266725640] [2025-03-04 01:33:40,311 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:33:40,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:33:40,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:40,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:33:40,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:33:40,312 INFO L87 Difference]: Start difference. First operand 242 states and 311 transitions. Second operand has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:33:40,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:40,578 INFO L93 Difference]: Finished difference Result 378 states and 482 transitions. [2025-03-04 01:33:40,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:33:40,583 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) Word has length 127 [2025-03-04 01:33:40,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:40,584 INFO L225 Difference]: With dead ends: 378 [2025-03-04 01:33:40,584 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 01:33:40,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 243 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=307, Unknown=0, NotChecked=0, Total=420 [2025-03-04 01:33:40,585 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 316 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:40,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 520 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:40,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 01:33:40,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 123. [2025-03-04 01:33:40,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.2647058823529411) internal successors, (129), 102 states have internal predecessors, (129), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:40,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 157 transitions. [2025-03-04 01:33:40,596 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 157 transitions. Word has length 127 [2025-03-04 01:33:40,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:40,597 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 157 transitions. [2025-03-04 01:33:40,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 8.11111111111111) internal successors, (73), 11 states have internal predecessors, (73), 4 states have call successors, (28), 3 states have call predecessors, (28), 5 states have return successors, (28), 2 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:33:40,597 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 157 transitions. [2025-03-04 01:33:40,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:40,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:40,598 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:40,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2025-03-04 01:33:40,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:40,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:40,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:40,799 INFO L85 PathProgramCache]: Analyzing trace with hash -659367607, now seen corresponding path program 1 times [2025-03-04 01:33:40,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:40,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160639947] [2025-03-04 01:33:40,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:40,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:40,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:40,801 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:40,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2025-03-04 01:33:40,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:41,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:41,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:41,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:41,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 01:33:41,251 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:41,257 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-04 01:33:41,297 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:41,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:41,298 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:41,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160639947] [2025-03-04 01:33:41,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160639947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:41,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:41,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:33:41,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30106454] [2025-03-04 01:33:41,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:41,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:33:41,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:41,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:33:41,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:33:41,300 INFO L87 Difference]: Start difference. First operand 123 states and 157 transitions. Second operand has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:41,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:41,598 INFO L93 Difference]: Finished difference Result 322 states and 411 transitions. [2025-03-04 01:33:41,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:33:41,598 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 127 [2025-03-04 01:33:41,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:41,600 INFO L225 Difference]: With dead ends: 322 [2025-03-04 01:33:41,600 INFO L226 Difference]: Without dead ends: 202 [2025-03-04 01:33:41,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:33:41,602 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 120 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1069 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:41,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1069 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:33:41,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2025-03-04 01:33:41,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 122. [2025-03-04 01:33:41,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.2673267326732673) internal successors, (128), 101 states have internal predecessors, (128), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 156 transitions. [2025-03-04 01:33:41,614 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 156 transitions. Word has length 127 [2025-03-04 01:33:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:41,614 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 156 transitions. [2025-03-04 01:33:41,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.571428571428571) internal successors, (60), 7 states have internal predecessors, (60), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 156 transitions. [2025-03-04 01:33:41,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-04 01:33:41,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:41,614 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:41,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2025-03-04 01:33:41,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:41,819 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:41,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:41,820 INFO L85 PathProgramCache]: Analyzing trace with hash 82828133, now seen corresponding path program 1 times [2025-03-04 01:33:41,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:41,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [788750121] [2025-03-04 01:33:41,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:41,820 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:41,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:41,822 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:41,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2025-03-04 01:33:41,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-04 01:33:42,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-04 01:33:42,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:42,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:42,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:33:42,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:42,458 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 79 treesize of output 43 [2025-03-04 01:33:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 180 proven. 0 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 01:33:42,473 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:42,473 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:42,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [788750121] [2025-03-04 01:33:42,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [788750121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:42,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:42,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:42,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106702959] [2025-03-04 01:33:42,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:42,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:42,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:42,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:42,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:42,474 INFO L87 Difference]: Start difference. First operand 122 states and 156 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:44,973 INFO L93 Difference]: Finished difference Result 242 states and 310 transitions. [2025-03-04 01:33:44,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:33:44,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2025-03-04 01:33:44,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:44,974 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:33:44,974 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:33:44,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:44,975 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 97 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:44,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 416 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-04 01:33:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:33:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-04 01:33:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.2574257425742574) internal successors, (127), 101 states have internal predecessors, (127), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 155 transitions. [2025-03-04 01:33:44,986 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 155 transitions. Word has length 127 [2025-03-04 01:33:44,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:44,986 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 155 transitions. [2025-03-04 01:33:44,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 5 states have internal predecessors, (63), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:44,986 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 155 transitions. [2025-03-04 01:33:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-04 01:33:44,986 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:44,986 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:45,001 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2025-03-04 01:33:45,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:45,187 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:45,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:45,188 INFO L85 PathProgramCache]: Analyzing trace with hash -436992541, now seen corresponding path program 1 times [2025-03-04 01:33:45,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:45,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416952214] [2025-03-04 01:33:45,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:45,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:45,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:45,190 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:45,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2025-03-04 01:33:45,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-04 01:33:45,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-04 01:33:45,703 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:45,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:45,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:33:45,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:45,838 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 77 treesize of output 41 [2025-03-04 01:33:45,853 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 160 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2025-03-04 01:33:45,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:45,853 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:45,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416952214] [2025-03-04 01:33:45,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416952214] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:45,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:45,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:45,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028571951] [2025-03-04 01:33:45,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:45,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:45,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:45,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:45,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:45,854 INFO L87 Difference]: Start difference. First operand 122 states and 155 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:47,957 INFO L93 Difference]: Finished difference Result 242 states and 308 transitions. [2025-03-04 01:33:47,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:33:47,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2025-03-04 01:33:47,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:47,964 INFO L225 Difference]: With dead ends: 242 [2025-03-04 01:33:47,964 INFO L226 Difference]: Without dead ends: 123 [2025-03-04 01:33:47,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:47,965 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 88 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:47,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 411 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-04 01:33:47,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-04 01:33:47,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2025-03-04 01:33:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.2475247524752475) internal successors, (126), 101 states have internal predecessors, (126), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:47,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 154 transitions. [2025-03-04 01:33:47,974 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 154 transitions. Word has length 129 [2025-03-04 01:33:47,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:47,975 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 154 transitions. [2025-03-04 01:33:47,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 5 states have internal predecessors, (65), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:47,975 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 154 transitions. [2025-03-04 01:33:47,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 01:33:47,975 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:47,975 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:47,991 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-04 01:33:48,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-04 01:33:48,176 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:48,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1949007259, now seen corresponding path program 1 times [2025-03-04 01:33:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:48,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1171484389] [2025-03-04 01:33:48,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:48,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:48,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:48,178 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:48,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2025-03-04 01:33:48,302 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 01:33:48,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 01:33:48,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:48,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:48,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 01:33:48,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:48,853 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 77 treesize of output 41 [2025-03-04 01:33:48,870 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2025-03-04 01:33:48,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:48,870 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:48,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1171484389] [2025-03-04 01:33:48,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1171484389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:48,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:48,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:48,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128285070] [2025-03-04 01:33:48,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:48,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:48,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:48,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:48,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:33:48,871 INFO L87 Difference]: Start difference. First operand 122 states and 154 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:51,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:51,125 INFO L93 Difference]: Finished difference Result 241 states and 305 transitions. [2025-03-04 01:33:51,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:33:51,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2025-03-04 01:33:51,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:51,133 INFO L225 Difference]: With dead ends: 241 [2025-03-04 01:33:51,133 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 01:33:51,133 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:33:51,133 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 79 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:51,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 407 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-04 01:33:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 01:33:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-03-04 01:33:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 99 states have internal predecessors, (123), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 151 transitions. [2025-03-04 01:33:51,143 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 151 transitions. Word has length 131 [2025-03-04 01:33:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:51,143 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 151 transitions. [2025-03-04 01:33:51,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 01:33:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 151 transitions. [2025-03-04 01:33:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:33:51,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:51,144 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:51,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2025-03-04 01:33:51,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:51,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:51,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:51,346 INFO L85 PathProgramCache]: Analyzing trace with hash -215451420, now seen corresponding path program 1 times [2025-03-04 01:33:51,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:51,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1427668374] [2025-03-04 01:33:51,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:51,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:51,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:51,349 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-04 01:33:51,351 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-04 01:33:51,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:33:51,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:33:51,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:51,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:51,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 01:33:51,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:52,004 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 76 treesize of output 40 [2025-03-04 01:33:52,039 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 96 proven. 44 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2025-03-04 01:33:52,039 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:52,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2025-03-04 01:33:52,155 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 33 proven. 6 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2025-03-04 01:33:52,155 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:52,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1427668374] [2025-03-04 01:33:52,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1427668374] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 01:33:52,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:33:52,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2025-03-04 01:33:52,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939894821] [2025-03-04 01:33:52,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:33:52,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:33:52,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:52,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:33:52,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:33:52,156 INFO L87 Difference]: Start difference. First operand 120 states and 151 transitions. Second operand has 12 states, 11 states have (on average 10.0) internal successors, (110), 12 states have internal predecessors, (110), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-04 01:33:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:54,696 INFO L93 Difference]: Finished difference Result 256 states and 320 transitions. [2025-03-04 01:33:54,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 01:33:54,701 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 10.0) internal successors, (110), 12 states have internal predecessors, (110), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 133 [2025-03-04 01:33:54,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:54,702 INFO L225 Difference]: With dead ends: 256 [2025-03-04 01:33:54,702 INFO L226 Difference]: Without dead ends: 128 [2025-03-04 01:33:54,703 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-03-04 01:33:54,703 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 88 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:54,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 681 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-03-04 01:33:54,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-04 01:33:54,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2025-03-04 01:33:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 99 states have internal predecessors, (121), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:54,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 149 transitions. [2025-03-04 01:33:54,720 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 149 transitions. Word has length 133 [2025-03-04 01:33:54,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:54,721 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 149 transitions. [2025-03-04 01:33:54,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 10.0) internal successors, (110), 12 states have internal predecessors, (110), 4 states have call successors, (27), 3 states have call predecessors, (27), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-04 01:33:54,721 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 149 transitions. [2025-03-04 01:33:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:33:54,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:54,721 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:54,741 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-04 01:33:54,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:54,922 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:54,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash -207692061, now seen corresponding path program 1 times [2025-03-04 01:33:54,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:54,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [201366274] [2025-03-04 01:33:54,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:54,923 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:54,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:54,925 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:54,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2025-03-04 01:33:55,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:33:55,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:33:55,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:55,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:55,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:33:55,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:55,526 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-04 01:33:55,538 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-04 01:33:55,540 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-04 01:33:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:55,559 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:55,559 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:55,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [201366274] [2025-03-04 01:33:55,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [201366274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:55,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:55,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:55,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108259216] [2025-03-04 01:33:55,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:55,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:55,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:55,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:55,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:55,560 INFO L87 Difference]: Start difference. First operand 120 states and 149 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:56,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:56,119 INFO L93 Difference]: Finished difference Result 312 states and 385 transitions. [2025-03-04 01:33:56,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:56,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-03-04 01:33:56,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:56,122 INFO L225 Difference]: With dead ends: 312 [2025-03-04 01:33:56,122 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 01:33:56,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:56,122 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 121 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:56,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 458 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:33:56,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 01:33:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 120. [2025-03-04 01:33:56,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.2121212121212122) internal successors, (120), 99 states have internal predecessors, (120), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 148 transitions. [2025-03-04 01:33:56,134 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 148 transitions. Word has length 133 [2025-03-04 01:33:56,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:56,134 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 148 transitions. [2025-03-04 01:33:56,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 148 transitions. [2025-03-04 01:33:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:33:56,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:56,137 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:56,152 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 (15)] Forceful destruction successful, exit code 0 [2025-03-04 01:33:56,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:56,337 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:56,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:56,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1037072420, now seen corresponding path program 1 times [2025-03-04 01:33:56,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:56,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [764643691] [2025-03-04 01:33:56,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:56,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:56,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:56,340 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-04 01:33:56,341 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-04 01:33:56,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:33:57,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:33:57,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:57,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:57,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 01:33:57,212 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:57,216 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-04 01:33:57,248 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-04 01:33:57,250 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-04 01:33:57,273 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:57,273 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:57,273 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:57,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [764643691] [2025-03-04 01:33:57,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [764643691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:57,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:57,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:33:57,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091358452] [2025-03-04 01:33:57,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:57,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:33:57,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:57,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:33:57,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:33:57,274 INFO L87 Difference]: Start difference. First operand 120 states and 148 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:57,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:57,721 INFO L93 Difference]: Finished difference Result 312 states and 383 transitions. [2025-03-04 01:33:57,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:33:57,722 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-03-04 01:33:57,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:57,723 INFO L225 Difference]: With dead ends: 312 [2025-03-04 01:33:57,723 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 01:33:57,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:57,724 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 109 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:57,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 455 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:33:57,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 01:33:57,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 120. [2025-03-04 01:33:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 99 states have (on average 1.202020202020202) internal successors, (119), 99 states have internal predecessors, (119), 14 states have call successors, (14), 6 states have call predecessors, (14), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-03-04 01:33:57,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 147 transitions. [2025-03-04 01:33:57,734 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 147 transitions. Word has length 133 [2025-03-04 01:33:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:57,734 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 147 transitions. [2025-03-04 01:33:57,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 147 transitions. [2025-03-04 01:33:57,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:33:57,735 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:57,735 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:57,753 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2025-03-04 01:33:57,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:57,936 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:57,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:57,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1166155139, now seen corresponding path program 1 times [2025-03-04 01:33:57,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:57,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760514077] [2025-03-04 01:33:57,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:57,937 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:57,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:57,939 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:33:57,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2025-03-04 01:33:58,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:33:58,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:33:58,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:58,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:58,486 INFO L256 TraceCheckSpWp]: Trace formula consists of 392 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 01:33:58,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:58,791 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-04 01:33:58,832 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 51 treesize of output 39 [2025-03-04 01:33:58,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2025-03-04 01:33:58,855 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 96 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2025-03-04 01:33:58,855 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:33:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:58,953 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:58,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760514077] [2025-03-04 01:33:58,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760514077] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 01:33:58,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:33:58,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 10 [2025-03-04 01:33:58,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750233039] [2025-03-04 01:33:58,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:58,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:33:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:58,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:33:58,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:33:58,954 INFO L87 Difference]: Start difference. First operand 120 states and 147 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:59,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:33:59,146 INFO L93 Difference]: Finished difference Result 195 states and 235 transitions. [2025-03-04 01:33:59,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:33:59,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-03-04 01:33:59,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:33:59,148 INFO L225 Difference]: With dead ends: 195 [2025-03-04 01:33:59,148 INFO L226 Difference]: Without dead ends: 193 [2025-03-04 01:33:59,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:33:59,149 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 100 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:33:59,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 788 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:33:59,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-04 01:33:59,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2025-03-04 01:33:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 153 states have (on average 1.1764705882352942) internal successors, (180), 154 states have internal predecessors, (180), 26 states have call successors, (26), 12 states have call predecessors, (26), 12 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:33:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 232 transitions. [2025-03-04 01:33:59,168 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 232 transitions. Word has length 133 [2025-03-04 01:33:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:33:59,168 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 232 transitions. [2025-03-04 01:33:59,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:33:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 232 transitions. [2025-03-04 01:33:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:33:59,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:33:59,169 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:33:59,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2025-03-04 01:33:59,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:59,370 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:33:59,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:33:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1167078660, now seen corresponding path program 1 times [2025-03-04 01:33:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:33:59,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225586888] [2025-03-04 01:33:59,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:33:59,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:33:59,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:33:59,374 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-04 01:33:59,376 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-04 01:33:59,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:33:59,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:33:59,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:33:59,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:33:59,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:33:59,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:33:59,893 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-04 01:33:59,954 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-04 01:33:59,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:33:59,955 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:33:59,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225586888] [2025-03-04 01:33:59,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225586888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:33:59,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:33:59,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:33:59,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948833072] [2025-03-04 01:33:59,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:33:59,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:33:59,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:33:59,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:33:59,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:33:59,956 INFO L87 Difference]: Start difference. First operand 192 states and 232 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:34:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:00,146 INFO L93 Difference]: Finished difference Result 328 states and 396 transitions. [2025-03-04 01:34:00,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:34:00,146 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 133 [2025-03-04 01:34:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:00,148 INFO L225 Difference]: With dead ends: 328 [2025-03-04 01:34:00,148 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 01:34:00,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:34:00,148 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 108 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:00,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 627 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:34:00,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 01:34:00,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2025-03-04 01:34:00,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 160 states have (on average 1.16875) internal successors, (187), 161 states have internal predecessors, (187), 28 states have call successors, (28), 13 states have call predecessors, (28), 13 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2025-03-04 01:34:00,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 243 transitions. [2025-03-04 01:34:00,168 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 243 transitions. Word has length 133 [2025-03-04 01:34:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:00,168 INFO L471 AbstractCegarLoop]: Abstraction has 202 states and 243 transitions. [2025-03-04 01:34:00,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 01:34:00,168 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 243 transitions. [2025-03-04 01:34:00,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:34:00,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:00,169 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:00,183 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-04 01:34:00,369 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-04 01:34:00,370 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:00,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:00,370 INFO L85 PathProgramCache]: Analyzing trace with hash 2054582341, now seen corresponding path program 1 times [2025-03-04 01:34:00,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:34:00,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148457506] [2025-03-04 01:34:00,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:00,371 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:34:00,371 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:34:00,372 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-04 01:34:00,373 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-04 01:34:00,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:34:00,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:34:00,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:00,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:00,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 01:34:00,863 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:01,577 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-04 01:34:01,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 89 [2025-03-04 01:34:01,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 75 [2025-03-04 01:34:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 01:34:01,742 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:01,856 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:34:01,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148457506] [2025-03-04 01:34:01,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148457506] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:01,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [474759022] [2025-03-04 01:34:01,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:01,857 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-03-04 01:34:01,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2025-03-04 01:34:01,868 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-03-04 01:34:01,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2025-03-04 01:34:02,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 01:34:03,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 01:34:03,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:34:03,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:34:03,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-04 01:34:03,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:34:04,244 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-04 01:34:04,795 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-04 01:34:05,105 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 125 treesize of output 89 [2025-03-04 01:34:05,108 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 135 treesize of output 75 [2025-03-04 01:34:05,127 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2025-03-04 01:34:05,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 01:34:05,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [474759022] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:34:05,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 01:34:05,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2025-03-04 01:34:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628374778] [2025-03-04 01:34:05,218 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 01:34:05,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 01:34:05,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:34:05,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 01:34:05,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2025-03-04 01:34:05,219 INFO L87 Difference]: Start difference. First operand 202 states and 243 transitions. Second operand has 16 states, 16 states have (on average 8.125) internal successors, (130), 15 states have internal predecessors, (130), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:34:08,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:34:08,412 INFO L93 Difference]: Finished difference Result 632 states and 761 transitions. [2025-03-04 01:34:08,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:34:08,413 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.125) internal successors, (130), 15 states have internal predecessors, (130), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 133 [2025-03-04 01:34:08,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:34:08,415 INFO L225 Difference]: With dead ends: 632 [2025-03-04 01:34:08,415 INFO L226 Difference]: Without dead ends: 506 [2025-03-04 01:34:08,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 302 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2025-03-04 01:34:08,416 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 587 mSDsluCounter, 999 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-04 01:34:08,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1142 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-04 01:34:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2025-03-04 01:34:08,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 381. [2025-03-04 01:34:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 305 states have (on average 1.1672131147540983) internal successors, (356), 309 states have internal predecessors, (356), 52 states have call successors, (52), 23 states have call predecessors, (52), 23 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-04 01:34:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 460 transitions. [2025-03-04 01:34:08,457 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 460 transitions. Word has length 133 [2025-03-04 01:34:08,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:34:08,457 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 460 transitions. [2025-03-04 01:34:08,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.125) internal successors, (130), 15 states have internal predecessors, (130), 4 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-04 01:34:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 460 transitions. [2025-03-04 01:34:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-04 01:34:08,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:34:08,458 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:34:08,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2025-03-04 01:34:08,673 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-04 01:34:08,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-04 01:34:08,859 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:34:08,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:34:08,859 INFO L85 PathProgramCache]: Analyzing trace with hash 247127878, now seen corresponding path program 1 times [2025-03-04 01:34:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:34:08,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094764133] [2025-03-04 01:34:08,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:34:08,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:34:08,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:34:08,862 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:34:08,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2025-03-04 01:34:09,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes.